The Four-Colour Theorem

1997/05/01 by Neil Robertson, Daniel P. Sanders, Daniel Sanders +2 · 11 citations
Computer Science · #Advanced Graph Theory Research #Computational Geometry and Mesh Generation

paper · doi:10.1006/jctb.1997.1750

crossref issued 1997/05/01 · crossref published 1997/05/01 · crossref published-print 1997/05/01 · openalex publication_date 1997/05/01 · crossref created 2002/09/18 · crossref deposited 2019/12/16 · openalex created_date 2025/10/10 · crossref indexed 2026/07/21 · openalex updated_date 2026/07/23

Citations

• The Reducibility of Maps

Cited by

• Efficiently four-coloring planar graphs
• How false is Kempe’s proof of the Four Color Theorem? Part II
• On the Generation of Oriented Matroids
• Random planar graphs
• Invitation to Fixed-Parameter Algorithms
• Complete and almost complete minors in double-critical 8-chromatic\n graphs
• Edge-colouring eight-regular planar graphs
• Planar Graphs of Maximum Degree Seven are Class I
• Three-edge-colouring doublecross cubic graphs
• Four color theorem [wikipedia]
• Graph theory [wikipedia]
• Paul Seymour (mathematician) [wikipedia]