The four-colour theorem (Q1369648)
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 1076870
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The four-colour theorem |
scientific article; zbMATH DE number 1076870 |
Statements
The four-colour theorem (English)
0 references
16 March 1998
0 references
The four-colour theorem, that every loopless planar graph has a vertex colouring with at most four colours, was proved by Appel and Haken in 1976, using a computer. Here another proof is given, still using a computer, but simpler than the original.
0 references
four colour theorem
0 references
planar graph
0 references
vertex colouring
0 references
0 references
