A short list color proof of Grötzsch's theorem

Journal of Combinatorial Theory. Series B

Volumn 88, Issue 1, 2003, Pages 189-192

  Thomassen, Carsten ^a  

^a TECHNICAL UNIVERSITY OF DENMARK   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0038286531     PISSN: 00958956     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0095-8956(03)00029-7     Document Type: Article

References (6)

1. H. Grötzsch, Ein Dreifarbensatz für dreikreisfreie Netze auf der Kugel, Wiss. Z. Martin-Luther-Univ. Halle-Wittenberg Math.-Natur. Reihe 8 (1959) 109-120.
2. R. Steinberg, D.H. Younger, Grötzsch's theorem for the projective plane, Ars Combin. 28 (1989) 15-31.
3. C. Thomassen, Every planar graph is 5-choosable, J. Combin. Theory Ser. B 62 (1994) 180-181.
4. C. Tbomassen, Grötzsch's 3-color theorem and its counterpart for the torus and the projective plane, J. Combin. Theory Ser. B 62 (1994) 268-279.
5. C. Thomassen, 3-list-coloring planar graphs of girth 5, J. Combin. Theory Ser. B 64 (1995) 101-107.
6. C. Thomassen, The chromatic number of a graph of girth 5 on a fixed surface, to be submitted.