Every planar map is four colorable part I: Discharging1

Illinois Journal of Mathematics

Volumn 21, Issue 3, 1977, Pages 429-490

  Appel, K ^a   Haken, W ^a  

^a UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84972498411     PISSN: 00192082     EISSN: None     Source Type: Journal    
DOI: 10.1215/ijm/1256049011     Document Type: Article

References (30)

1. F. Allaire, A minimal 5-chromatic planar graph contains a 6-valent vertex, to appear.
2. F. Allaire and E. R. Swart, A systematic approach to the determination of reducible configurations in the four-color conjecture, J. Combinatorial Theory (B), to appear.
3. K. Appel and W. Haken, An unavoidable set of configurations in planar triangulations, J. Combinatorial Theory (B), to appear.
4. K. Appel and W. Haken, The existence of unavoidable sets of geographically good configurations, Illinois J. Math., vol. 20 (1976), pp. 218-297.
5. 5 séparés dans le problème des quatre couleurs, J. Combinatorial Theory (B), to appear.
6. A. Bernhart, Six rings in minimal five color maps, Amer. J. Math., vol. 69 (1947), pp. 391-412.
7. A. Bernhart, Another reducible edge configuration, Amer. J. Math., vol. 70 (1948), pp. 144-146.
8. F. Bernhart, On the characterization of reductions of small order, J. Combinatorial Theory (B), to appear.
9. F. Bernhart and S. Gill, An extension of Winn’s result on reducible minor neighborhoods, to appear.
10. G. D. Birkhoff, The reducibility of maps, Amer. J. Math., vol. 35 (1913), pp. 114-128.
11. C. Chojnacki, A contribution to the four color problem, Amer. J. Math., vol. 64 (1942), pp. 36-54.
12. K. Dürre, Untersuchungen an Mengen von Signierungen, Doctoral Dissertation, Tech nische Universität Hannover, 1969.
13. P. Errera, Une contribution au problème des quatre couleurs, Bull. Soc. Math. France, vol. 53 (1925), pp. 42-55.
14. Ph. Franklin, The four color problem, Amer. J. Math., vol. 44 (1922), pp. 225-236.
15. W. Haken, An existence theorem for planar maps, J. Combinatorial Theory, vol. 14 (1973), pp. 180-184.
16. H. Heesch, Untersuchungen zum Vierfarbenproblem, I-Hochschulscripten 810/810a/810b, Bibliographisches Institut, Mannheim/Vienna/Zurich, 1969.
17. 7, J. Combinatorial Theory, vol. 13 (1972), pp. 46-53.
18. P. J. Heawood, Map color theorem, Quart. J. Pure Appl. Math., vol. 24 (1890), pp. 332-338.
19. A. B. Kempe, On the geographical problem of the four colors, Amer. J. Math., vol. 2 (1879), pp. 193-200.
20. J. Koch, Computation of four color reducibility, Ph.D. Thesis, 1976, Department of Com puter Science Report no. UIUCDCS-R-76-802, University of Illinois at Urbana-Champaign, Urbana, Illinois.
21. H. Lebesgue, Quelques conséquences simples de la Formule d’Euler, J. de Math., vol. 9 (1940), pp. 27-43.
22. J. Mayer, Problème des quatre couleurs, un contre-exemple doit avoir au moins 96 sommets, J. Combinatorial Theory (B), to appear.
23. O. Ore and J. Stemple, Numerical calculations on the four color problem, J. Combinatorial Theory, vol. 8 (1970), pp. 65-78.
24. T. Osgood, An existence theorem for planar triangulations with vertices of degree five, six, and eight, Ph.D. Thesis, 1974, University of Illinois at Urbana-Champaign, Urbana, Illinois.
25. R. Stanik, Zur Reduction von Triangulationen, Doctoral Dissertation, Technische Universität Hannover, 1974.
26. W. Stromquist, Some aspects of the four color problem, Ph.D. Thesis, Harvard University, 1975.
27. W. Tutte and H. Whitney, Kempe chains and the four colour problem, Utilitas Math ematica, vol. 2 (1972), pp. 241-281, reprinted in Studies in Graph Theory, Studies in Math., Math. Assoc, of America, vol. 12, 1976.
28. P. Wernicke, Über den kartographischen Vierfarbensatz, Math. Ann., vol. 58 (1904), pp. 413-426.
29. C. Winn, On the minimum number of polygons in an irreducible map, Amer. J. Math., vol. 62 (1940), pp. 406-416.
30. K. Dürre, H. Heesch, and F. Miehe, Eine Figurenliste zur Chromatischen Reduktion, Preprint № 73 (1977), Institut für Mathematik der TU Hannover.