A short list color proof of Grötzsch's theorem
In [\textit{C. Thomassen}, J. Comb. Theory, Ser. B 64, 101-107 (1995; Zbl 0822.05029)] it was proved that every planar graph of girth 5 is 3-list-colorable. In the present note, the author gives a short proof of this result. This result and its proof are used in [\textit{C. Thomassen}, J. Comb. Theory, Ser. B 87, 38-71 (2003; Zbl 1020.05030)] to conclude that the chromatic number of graphs of girth 5 on every fixed surface can be found in polynomial time.
scientific article; zbMATH DE number 1970685
scientific article