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. © 1997 Academic Press.
Cite
CITATION STYLE
APA
Robertson, N., Sanders, D., Seymour, P., & Thomas, R. (1997). The four-colour theorem. Journal of Combinatorial Theory. Series B, 70(1), 2–44. https://doi.org/10.1006/jctb.1997.1750
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free