# Every planar map is four colorable

@inproceedings{Appel1989EveryPM, title={Every planar map is four colorable}, author={K. Appel and W. Haken}, year={1989} }

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

1,159 Citations

#### References

##### Publications referenced by this paper.

SHOWING 1-6 OF 6 REFERENCES

A systematic approach to the determination of reducible configurations in the four-color conjecture

- Computer Science, Mathematics
- 1978

7

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