The four-colour theorem
type: Item
instance of: scholarly article
title: The four-colour theorem
zbMATH Open document ID: 0883.05056
author: Neil Robertson
author: Robin Thomas
author: Daniel P. Sanders
author: Paul Seymour
published in: Journal of Combinatorial Theory. Series B
publication date: 1998-03-16T00:00:00Z
review text: The four-colour theorem, that every loopless planar graph has a vertex colouring with at most four colours, was proved by Appel and Haken in 1976, using a computer. Here another proof is given, still using a computer, but simpler than the original.
Mathematics Subject Classification ID: 05C15
zbMATH DE Number: 1076870
zbMATH Keywords: four colour theorem
zbMATH Keywords: planar graph
zbMATH Keywords: vertex colouring
reviewed by: Chris Jagger
MaRDI profile type: Publication
OpenAlex ID: W2131433460
cites work: Q4742810
cites work: A systematic approach to the determination of reducible configurations in the four-color conjecture
cites work: Every Planar Map is Four Colorable
cites work: Every planar map is four colorable. I: Discharging
cites work: Every planar map is four colorable. II: Reducibility
cites work: Another Reducible Edge Configuration
cites work: Q4028462
cites work: Q5578802
cites work: Q3852204
cites work: Q4093465
Wikidata QID: Q55899217
DBLP publication ID: journals/jct/RobertsonSST97
DOI: 10.1006/JCTB.1997.1750
description: scientific article; zbMATH DE number 1076870