1976
DOI: 10.1090/s0002-9904-1976-14122-5
|View full text |Cite
|
Sign up to set email alerts
|

Every planar map is four colorable

Abstract: The following theorem is proved. THEOREM. Every planar map can be colored with at most four colors. AMS (MOS) subject classifications (1970). Primary 05C15. 1 This work appears in full in two papers, Every planar map is four colorable; part I, Discharging, by K. Appel and W. Haken and part II, Reducibility, by K. Appel, W. Haken, and J. Koch. These papers have been submitted to another journal.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

1
213
0
6

Year Published

1992
1992
2014
2014

Publication Types

Select...
6
4

Relationship

0
10

Authors

Journals

citations
Cited by 578 publications
(220 citation statements)
references
References 2 publications
(2 reference statements)
1
213
0
6
Order By: Relevance
“…There are of course, particular cases such as the solution of the celebrated four colour problem, which states that χ = 4 for any planar map [30]. χ = 2 trivially for a planar square lattice and a three colouring algorithm also exists as a consequence of the solution of the six vertex model [31].…”
Section: Higher State Potts Modelsmentioning
confidence: 99%
“…There are of course, particular cases such as the solution of the celebrated four colour problem, which states that χ = 4 for any planar map [30]. χ = 2 trivially for a planar square lattice and a three colouring algorithm also exists as a consequence of the solution of the six vertex model [31].…”
Section: Higher State Potts Modelsmentioning
confidence: 99%
“…Herein, we report that the global topology of the antiphase and chiral domain patterns in Fe x TaS 2 appears to be complex, but can be neatly understood in terms of the four color theorem [21][22][23] as well as a tensorial color theorem associated with two-step proper coloring. The four color theorem, which was empirically known to cartographers before the 17th century,…”
Section: ■ Introductionmentioning
confidence: 99%
“…Secondly, this result is not a consequence of the fourcolourability of planar graphs first conjectured by Francis Guthrie and proved by Appel and Haken (1977). Consider a pedigree in which three males each mate with each of three females.…”
Section: Notesmentioning
confidence: 82%