A new proof of Grünbaum's 3 color theorem (Q1357735): Difference between revisions

Grünbaum's 3-colour theorem states that every planar graph with at most three triangles is 3-colourable. It was obtained by Grünbaum in 1963 as a consequence of a certain more technical result which was, however, later disproved by Gallai. In 1974, \textit{V. A. Aksenov} [Diskret. Analiz, Novosibirsk 26, 3-19 (1974; Zbl 0308.05107)] corrected Grünbaum's technical statement and thus provided a correct proof of the 3-colour theorem. The paper gives a simpler proof avoiding the technical result mentioned.