Die Anzahl der Faerbungen ebener Graphen

Details Die Anzahl der Faerbungen ebener Graphen Die Anzahl der Faerbungen ebener Graphen

2004-10-13

arxiv.org/abs/math/0410319v1

Mathematics

Combinatorics

98 pages, 35 figures, in german, with large heuristic stuff. Submitted to "Mathematische Annalen" in September 2003. Postscrip

Scientific paper

Let G be a finite planar connected graph without loops or multiple edges. All
minimal circuits except atmost one - say C* - are triangles. Let k be the
number of vertices of C*. There are at least 2**(k-3) colorings of the vertices
of G with four colors, vertices connected by edges colored differently. These
colorings are different on C*.

Affiliated with

Also associated with

No associations

Rating

Die Anzahl der Faerbungen ebener Graphen does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Die Anzahl der Faerbungen ebener Graphen, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Die Anzahl der Faerbungen ebener Graphen will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-136755