P. J. Heawood. Map-color theorem. Quarterly Journal of Pure and Applied Mathematics, 2:193-200, 1890.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....and every planar graph can be decomposed into at most three edge disjoint forests [8] The genus g(G) of a graph G is the minimum number of handles which must be added to a sphere so that G can be embedded on the resulting surface. Of course, g(G) 0 if and only if G is planar. It is known [14, 17] that if g(G) 1 : 7) Furthermore any subgraph H of G satis es g(H) g(G) Therefore, if g(G) 1 s(G) 8) One can observe that the following upper bound holds on the minimum degree. Lemma 1 The following (a) c) hold for any nontrivial graph G: a) G) 2a(G) 1 [8] ....

P. J. Heawood. Map color theorems. Quart. J. Math., 24:332-338, 1890.

....(S N ) be the minimum number of colors sufficient to color k cyclically each map on surface S N with Euler characteristic N . Sometimes we drop the arguments. The case k = 3 corresponds to the ordinary vertex colouring, and the Four Color Theorem by Appel and Haken [1] and Heawood s theorem [2] give precise upper bounds for the plane and for the higher surfaces, respectively. The case k = 4 may also be formulated in terms of the simultaneous vertex face coloring and the vertex coloring of 1 embeddable graphs. For the plane, Borodin [3] proved, confirming Ringel s conjecture in [4] ....

P.J.Heawood, Map-color theorem, Quart. J. Math., 24, (1890), 332-338.

....forests [8] X. Zhou et al. Edge Coloring and f Coloring , JGAA, 3(1) 1 18 (1999) 5 The genus g(G) of a graph G is the minimum number of handles which must be added to a sphere so that G can be embedded on the resulting surface. Of course, g(G) 0 if and only if G is planar. It is known [14, 17] that if g(G) 1 then (G) j 5 p 48g(G) 1 =2 k : 7) Furthermore any subgraph H of G satis es g(H) g(G) Therefore, if g(G) 1 then s(G) j 5 p 48g(G) 1 =2 k : 8) One can observe that the following upper bound holds on the minimum degree. Lemma 1 The ....

P. J. Heawood. Map color theorems. Quart. J. Math., 24:332-338, 1890.

....planar and every planar graph can be decomposed into at most three edge disjoint forests [7] The genus g(G) of a graph G is the minimum number of handles which must be added to a sphere so that G can be embedded on the resulting surface. Of course, g(G) 0 if and only if G is planar. It is known [13, 16] that if g(G) 1 then (G) j 5 p 48g(G) 1 =2 k : 7) Furthermore any subgraph H of G satis es g(H) g(G) Therefore, if g(G) 1 then (G) j 5 p 48g(G) 1 =2 k : 8) We observe that the following upper bound holds on the minimum degree. Lemma 1 The following ....

P. J. Heawood. Map color theorems. Quart. J. Math., 24:332-338, 1890.

....coloring and graph representation. 1 Introduction Graph Coloring is a central topic in Graph Theory and numerous studies relate coloring properties with the genus of a graph. The maximum chromatic number among all graphs which can be embedded in a surface of genus g is given by Heawood s formula [14], as established by Ringel and Youngs for g 0 [22] the case g = 0, which is the Four Color Theorem, has been established by Appel and Haken [1] 2] see [24] for a simpler proof) Other approaches have related the chromatic number with other graph invariants: For instance, Szekeres and Wilf [28] ....

P.J. Heawood. Map color theorem. Q.J. Pure Appl. Math., 24:332-338, 1890.

No context found.

P. J. Heawood. Map-color theorem. Quarterly Journal of Pure and Applied Mathematics, 2:193-200, 1890.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC