# The Four-Colour Theorem

```@article{Robertson1997TheFT,
title={The Four-Colour Theorem},
author={Neil Robertson and Daniel P. Sanders and Paul D. Seymour and Robin Thomas},
journal={J. Comb. Theory, Ser. B},
year={1997},
volume={70},
pages={2-44}
}```
• Published 1 May 1997
• Mathematics
• J. Comb. Theory, Ser. B
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.
599 Citations

## Figures from this paper

### A new proof of the four-colour theorem

• Mathematics
• 1996
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 announce

### A mathematical proof of four color theorem

The four-color theorem, that every loopless planar graph admits a vertex-coloring with at most four different colors, was proved in 1976 by Appel and Haken, using a computer. In this article I

### Deciding 4-colorability of planar triangulations

We show, without using the Four Color Theorem, that for each planar triangulation, the number of its proper vertex colorings by 4 colors is a determinant and thus can be calculated in a polynomial

### A pictorial proof of the Four Colour Theorem

We give a pictorial, and absurdly simple, proof that transparently illustrates why four colours suffice to chromatically differentiate any set of contiguous, simply connected and bounded, planar

### Efficiently four-coloring planar graphs

• Mathematics
STOC '96
• 1996
An outline of aquadratic algorithm to 4-color planar graphs is presented, based upon anew proof of the Four Color Theorem. This algorithm improves aquartic algorithm of Appel and Haken.

### The chromatic number of the square of subcubic planar graphs

• Mathematics
• 2016
Wegner conjectured in 1977 that the square of every planar graph with maximum degree at most \$3\$ is \$7\$-colorable. We prove this conjecture using the discharging method and computational techniques

### The 5 Colour Theorem in Isabelle/Isar

• Mathematics
TPHOLs
• 2002
Based on an inductive definition of triangulations, a theory of undirected planar graphs is developed in Isabelle/HOL. The proof of the 5 colour theorem is discussed in some detail, emphasizing the

### The 2-Factor Polynomial Detects Even Perfect Matchings

• Mathematics
Electron. J. Comb.
• 2020
It is shown that the \$2-factor polynomial, an invariant of a planar trivalent graph with a perfect matching, counts the number of \$2\$-factors that contain the perfect matching as a subgraph and detects even perfect matchings.

## References

SHOWING 1-10 OF 20 REFERENCES

### Kempe Chains and the Four Colour Problem

• Mathematics
• 1992
In October 1971 the combinatorial world was swept by the rumour that the notorious Four Colour Problem had at last been solved, - that with the help of a computer it had been demonstrated that any

### XXIII.—Note on a Theorem in Geometry of Position

• Tait
• Mathematics
Transactions of the Royal Society of Edinburgh
• 1880
In connection with the problem of Map-colouring, I incidentally gave (Proc. K.S.E. 1880, p. 502) a theorem which may be stated as follows : — If 2n points be joined by 3n lines, so that three lines,

• No. 260,
• 1978

### \Another proof of the four colour theorem { Part I

• Manitoba Conf. on Numerical Math. and Computing, Proc. 7th Congressus Numerantium XX
• 1977