The four-colour theorem

Neil Robertson; Daniel Sanders; Paul Seymour; Robin Thomas

doi:10.1006/jctb.1997.1750

The four-colour theorem

Neil Robertson, Daniel Sanders, Paul Seymour, Robin Thomas

Research output: Contribution to journal › Article › peer-review

368 Scopus citations

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.

Original language	English (US)
Pages (from-to)	2-44
Number of pages	43
Journal	Journal of Combinatorial Theory. Series B
Volume	70
Issue number	1
DOIs	https://doi.org/10.1006/jctb.1997.1750
State	Published - May 1997
Externally published	Yes

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
Discrete Mathematics and Combinatorics
Computational Theory and Mathematics

Access to Document

10.1006/jctb.1997.1750

Cite this

@article{0c15e1dde1b9455e952f19c8bc900457,

title = "The four-colour theorem",

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.",

author = "Neil Robertson and Daniel Sanders and Paul Seymour and Robin Thomas",

year = "1997",

month = may,

doi = "10.1006/jctb.1997.1750",

language = "English (US)",

volume = "70",

pages = "2--44",

journal = "Journal of Combinatorial Theory. Series B",

issn = "0095-8956",

publisher = "Academic Press Inc.",

number = "1",

}

TY - JOUR

T1 - The four-colour theorem

AU - Robertson, Neil

AU - Sanders, Daniel

AU - Seymour, Paul

AU - Thomas, Robin

PY - 1997/5

Y1 - 1997/5

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0031146074&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0031146074&partnerID=8YFLogxK

U2 - 10.1006/jctb.1997.1750

DO - 10.1006/jctb.1997.1750

M3 - Article

AN - SCOPUS:0031146074

SN - 0095-8956

VL - 70

SP - 2

EP - 44

JO - Journal of Combinatorial Theory. Series B

JF - Journal of Combinatorial Theory. Series B

IS - 1

ER -

The four-colour theorem

Abstract

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this