On 3-Colorable Non-4-Choosable Planar Graphs

Journal of Graph Theory

Volumn 24, Issue 3, 1997, Pages 233-235

  Voigt, M ^a   Wirth, B ^b  

^a ILMENAU UNIVERSITY OF TECHNOLOGY   (Germany)

^b UNIVERSITY OF COLOGNE   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0031542607     PISSN: 03649024     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1097-0118(199703)24:3<233::AID-JGT4>3.0.CO;2-Q     Document Type: Article

References (9)

1. N. Alon and M. Tarsi, Colorings and orientations of graphs. Combinatorica 12 (2) (1992), 125-134.
2. P. Erdös, A. L. Rubin, and H. Taylor, Choosability in Graphs, Proceedings of the West Coast Conference on Combinatorics, Graph Theory and Computing, Arcata, California, 5.-7.9.1797, Congressus Numerantium XXVI.
3. S. Gutner, The complexity of planar graph choosability, manuscript. Discrete Math., in press.
4. T. R. Jensen and B. Toft, Graph Coloring Problems, Wiley-Interscience, New York (1995).
5. H. Sachs, private communication.
6. C. Thomassen, Every planar graph is 5-choosable. J. Comb. Theory Ser. B 62 (1994), 180-181.
7. C. Thomassen, 3-List-coloring planar graphs of girth 5. J. Comb. Theory Ser. B 64 (1995), 101-107.
8. V. G. Vizing, Coloring the vertices of a graph in prescribed colors (Russian), Diskret. Analiz No 29 Metody Diskret. Anal. v Teorii Kodov i Shem (1976), 3-10, 101 (MR58 # 16371).
9. M. Voigt, List colourings of planar graphs. Discrete Math. 120 (1993), 215-219.