Dirac's map-color theorem for choosability

Journal of Graph Theory

Volumn 32, Issue 4, 1999, Pages 327-339

  Bohme T ^a   Mohar, B ^b   Stiebitz, M ^a  

^a ILMENAU UNIVERSITY OF TECHNOLOGY   (Germany)

^b UNIVERSITY OF LJUBLJANA   (Slovenia)

Author keywords

Choosability; Critical graph; Graph coloring; Heawood number; List coloring; Projective plane

Indexed keywords

EID: 0042785337     PISSN: 03649024     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1097-0118(199912)32:4<327::AID-JGT2>3.0.CO;2-B     Document Type: Article

References (18)

1. O. Albertson and J. P. Hutchinson, The three excluded cases of Dirac's map-color theorem, Ann New York Acad Sci 319 (1979), 717.
2. O. V. Borodin, Criterion of chromaticity of a degree prescription, (in Russian), Abstracts of IV All-Union Conf Theoret Cybernet (Novosibirsk), 1977, pp. 127-128.
3. G. A. Dirac, Map colour theorems related to the Heawood colour formula, J London Math Soc 31 (1956), 460-471.
4. G. A. Dirac, A theorem of R. L. Brooks and a conjecture of H. Hadwiger, Proc London Math Soc 17 (1957), 161-195.
5. G. A. Dirac, Short proof of a map-colour theorem, Canad J Math 9 (1957), 225-226.
6. P. Erdos, A. L. Rubin, and H. Taylor, Choosability in graphs, Proc West Coast Conf Combin, Graph Theory Comput, Congressus Numerantium XXVI, 1979, pp. 125-157.
7. P. Franklin, A six-color problem, J Math Phys 13 (1934), 363-369.
8. T. Gallai, Kritische Graphen I, Publ Math Inst Hungar Acad Sci 8 (1963), 165-192.
9. P. J. Heawood, Map colour theorem, Quart J Pure Appl Math 24 (1890), 332-338.
10. T. R. Jensen and B. Toft, "Graph coloring problems," Wiley-Interscience series in discrete mathematics and optimization, Wiley, New York, 1995.
11. A. V. Kostochka, M Stiebitz, and B. Wirth, The colour theorems of Brooks and Gallai extended, Discrete Math 162 (1996), 299-303.
12. A. V. Kostochka and M. Stiebitz, A new lower bound on the number of edges in colour-critical graphs, Preprint No. 48, IMADA Odense Univ, 1997.
13. B. Mohar and C. Thomassen, Graphs on surfaces, Johns Hopkins Univ Press, to appear.
14. G. Ringel, Bestimmung der Maximalzahl der Nachbargebiete von nichtorientierbaren Flächen, Math Ann 127 (1954), 181-214.
15. G. Ringel and J. W. T. Youngs, Solution of the Heawood map-coloring problem, Proc Nat Acad Sci USA 60 (1968), 438-445.
16. C. Thomassen, Every planar graph is 5-choosable, J Combin Theory Ser B 62 (1994), 180-181.
17. C. Thomassen, Color-critical graphs on a fixed surface, J Combin Theory Ser B 70 (1994), 67-100.
18. M. Voigt, List colorings of planar graphs, Discrete Math 120 (1993), 21-219.