The four-colour theorem, that every loopless planar graph admits a ver
tex-colouring with at most four different colours, was proved in 1976
by Appel and Haken, using a computer. Here we give another proof, stil
l using a computer, but simpler than Appel and Haken's in several resp
ects. (C) 1997 Academic Press.