论文信息 - A short list color proof of Grötzsch's theorem

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

We give a short proof of the result that every planar graph of girth 5 is 3-choosable and hence also of Grotzsch's theorem saying that every planar triangle-free graph is 3-colorable.

Carsten Thomassen | C. Thomassen

[1] Carsten Thomassen. The chromatic number of a graph of girth 5 on a fixed surface , 2003, J. Comb. Theory, Ser. B.

[2] Carsten Thomassen,et al. Every Planar Graph Is 5-Choosable , 1994, J. Comb. Theory B.

[3] Carsten Thomassen,et al. 3-List-Coloring Planar Graphs of Girth 5 , 1995, J. Comb. Theory B.

[4] Richard Steinberg,et al. Grötzsch's theorem for the projective plane , 1989 .

[5] Carsten Thomassen,et al. Grötzsch's 3-Color Theorem and Its Counterparts for the Torus and the Projective Plane , 1994, J. Comb. Theory, Ser. B.