A New Proof Of The Four-Colour Theorem

A New Proof Of The Four-Colour Theorem (1996)

Cached

Download Links

by Neil Robertson , Daniel P. Sanders , Paul Seymour , Robin Thomas

Venue:	ELECTRON. RES. ANNOUNCE. AMER. MATH SOC
Citations:	20 - 0 self

BibTeX

@ARTICLE{Robertson96anew,
    author = {Neil Robertson and Daniel P. Sanders and Paul Seymour and Robin Thomas},
    title = {A New Proof Of The Four-Colour Theorem},
    journal = {ELECTRON. RES. ANNOUNCE. AMER. MATH SOC},
    year = {1996},
    volume = {2},
    number = {1},
    pages = {17--25}
}

Years of Citing Articles

Bookmark

OpenURL

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 announce another proof, still using a computer, but simpler than Appel and Haken's in several respects.

Citations

224	Every planar map is four-colorable - Appel, Haken - 1976
30	On the geographical problem of four colors - Kempe
12	Untersuchungen zum Vierfarbenproblem, Bibliog - Heesch - 1969
12	Note on a theorem in the geometry of position, Trans - Tait
11	The reducibility of maps - Birkhoff - 2000
3	Another proof of the four colour theorem-Part I - Allaire - 1978
3	Another reducible edge configuration - Bernhart - 1948
3	Une propriété des graphes minimaux dans le problème des quatres couleurs, Problèmes Combinatoires et Théorie des Graphes, Colloques internationaux CNRS No. 260 - Mayer - 1978
2	A systematic approach to the determination of reducible configurations in the four-color conjecture - Allaire, Swart - 1978
2	Block count consistency and the four color problem”, manuscript - Cohen
2	Eine Figurenliste zur chromatischen Reduktion, manuscript - Durre, Heesch, et al. - 1977
2	E.R.Swart, “A new type of 4-colour reducibility - Gismondi - 1991
2	The four colour theorem, manuscript - Robertson, Sanders, et al.
2	Kempe chains and the four colour problem, Studies in Graph Theory - Whitney, Tutte - 1975