This page gives a brief summary of a new proof of the Four Color Theorem and a four-coloring algorithm .
Joseph Culberson Department of Computing Science University of Alberta Edmonton, Alberta, Canada T6G 2H1
by Steven H. Cullinane
Neil Robertson, Daniel P. Sanders, Paul Seymour, and Robin Thomas
par Sylvain Poirier ProblÃ¨me de coloriage du plan euclidien ...(anciennement Ã cette adresse couleurs
by Neil Robertson, Daniel P. Sanders, Paul Seymour, and Robin Thomas
Electronic research announcements of the American Mathematical Society
Volume 2, Number 1, August 1996
The four-colour theorem, that every loopless planar graph admits a vertex-colouring with at most four di erent colours, was proved in 1976 by Appel and Haken, using a computer. Here we announce another proof, still using a computer, but simpler than Appel and Haken's in several respects.
The Four Colour Conjecture first seems to have been made by Francis Guthrie. He was a student at University College London where he studied under De Morgan.