Every planar map is four colorable

@inproceedings{Appel1989EveryPM,
  title={Every planar map is four colorable},
  author={K. Appel and W. Haken},
  year={1989}
}
  • K. Appel, W. Haken
  • Published 1989
  • Mathematics
  • As has become standard, the four color map problem will be considered in the dual sense as the problem of whether the vertices of every planar graph (without loops) can be colored with at most four colors in such a way that no pair of vertices which lie on a common edge have the same color. The restriction to triangulations with all vertices of degree at least five is a consequence of the work of A. B. Kempe. Over the past 100 years, a number of authors including A. B. Kempe, G. D. Birkhoff… CONTINUE READING
    Extending precolorings of subgraphs of locally planar graphs
    20
    TRIANGULATIONS OF S 3 AND THE COLORING OF GRAPHS
    1
    Colouring planar graphs
    The a-graph coloring problem
    6
    The a-graph coloring problem: revisiting the 4-color theorem
    Coloring Planar graphs via Colored Paths in the associahedra
    5
    Hadwiger's conjecture and seagull packing
    4
    {2, 2}-EXTENDABILITY OF PLANAR GRAPHS
    1
    Light subgraphs of graphs embedded in the plane and in the projective plane – a survey –
    21

    References

    Publications referenced by this paper.
    SHOWING 1-6 OF 6 REFERENCES
    Bibliographisches Institut
    • 1969
    Kempe chains and the four color problem, Utilitas Math
    • 1972
    Questions raised by Dan Younger in 1987 helped us to provide an appropriate level of detail in the sections on immersion reducibility in the appendix to Part II
    • 1987
    then high school students and undergraduates) for aiding in checking the diagrams in the preprints for the papers
    • 1977