Abstract
The four-colour theorem, that every loopless planar graph admits a vertex-colouring with at most four different colours, was proved in 1976 by Appel and Haken, using a computer. Here we give another proof, still using a computer, but simpler than Appel and Haken's in several respects.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 2-44 |
| Number of pages | 43 |
| Journal | Journal of Combinatorial Theory. Series B |
| Volume | 70 |
| Issue number | 1 |
| DOIs | |
| State | Published - May 1997 |
| Externally published | Yes |
All Science Journal Classification (ASJC) codes
- Theoretical Computer Science
- Discrete Mathematics and Combinatorics
- Computational Theory and Mathematics