A new proof of Grünbaum's 3 color theorem (Q1357735)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1021682
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A new proof of Grünbaum's 3 color theorem |
scientific article; zbMATH DE number 1021682 |
Statements
A new proof of Grünbaum's 3 color theorem (English)
0 references
16 June 1997
0 references
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.
0 references
3-colour theorem
0 references
planar graph
0 references
0 references
0.90070355
0 references
0 references
0.8949628
0 references
0.8883534
0 references
0.8855045
0 references
0.8852581
0 references
0.8852581
0 references
