A map colour theorem for the union of graphs

Journal of Combinatorial Theory. Series B

Volumn 96, Issue 1, 2006, Pages 20-37

  Stiebitz, Michael ^a   Škrekovski, Riste ^b,c  

^a ILMENAU UNIVERSITY OF TECHNOLOGY   (Germany)

^b CHARLES UNIVERSITY   (Czech Republic)

^c UNIVERSITY OF LJUBLJANA   (Slovenia)

Author keywords

Chromatic number; Graph decomposition; Surface embedding

Indexed keywords

EID: 29244459672     PISSN: 00958956     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jctb.2005.06.003     Document Type: Article

References (21)

1. M.O. Albertson J.P. Hutchinson The three excluded cases of Dirac's map-color theorem Ann. New York Acad. Sci. 319 1979 7-17
2. J. Battle F. Harary Y. Kodoma J.W.T. Youngs Additivity of the genus of a graph Bull. Amer. Math. Soc. 68 1962 565-568
3. T. Böhme B. Mohar M. Stiebitz Dirac's map-color theorem for choosability J. Graph Theory 32 2000 327-339
4. G.A. Dirac Note on the colouring of graphs Math. Z. 54 1951 347-353
5. G.A. Dirac Map colour theorems related to the Heawood colour formula J. London Math. Soc. 31 1956 460-471
6. G.A. Dirac A theorem of R.L. Brooks and a conjecture of H. Hadwiger Proc. London Math. Soc. 7 3 1957 161-195
7. G.A. Dirac Short proof of a map-colour theorem Canad. J. Math. 9 1957 225-226
8. P. Franklin A six-color problem J. Math. Phys. 13 1934 363-369
9. Z. Füredi, A.V. Kostochka, M. Stiebitz, R. Škrekovski, D.B. West, Nordhaus-Gaddum-type theorems for decompositions into many parts, J. Graph Theory, in print.
10. P.J. Heawood Map colour theorem Quart. J. Pure Appl. Math. 24 1890 332-338
11. T.R. Jensen B. Toft Graph Coloring Problems, Wiley-Interscience Series in Discrete Mathematics and Optimization 1995 Wiley New York
12. A.V. Kostochka M. Stiebitz A list version of Dirac's theorem on the number of edges in colour-critical graphs J. Graph Theory 39 2002 165-167
13. B. Mohar C. Thomassen Graphs on Surfaces 2001 Johns Hopkins University Press Baltimore
14. E.A. Nordhaus J.W. Gaddum On complementary graphs Amer. Math. Monthly 63 1956 175-177
15. T.D. Parson G. Pica T. Pisanski A.G.S. Ventre Orientably simple graphs Math. Slovaca 37 1987 391-394
16. G. Ringel Map Color Theorem 1974 Springer New York
17. G. Ringel J.W.T. Youngs Solution of the Heawood map-coloring problem Proc. Nat. Acad. Sci. USA 60 1968 438-445
18. S. Stahl L.W. Beineke Blocks and the non-orientable genus of graphs J. Graph Theory 1 1977 75-78
19. C. Thomassen Every planar graph is 5-choosable J. Combin. Theory Ser. B 62 1994 180-181
20. C. Thomassen Five coloring graphs on the torus J. Combin. Theory Ser. B 62 1994 11-33
21. M. Voigt List colorings of planar graphs Discrete Math. 120 1993 215-219