Skip to main content
SpringerLink
Log in
Book cover

Proceedings of the International Congress of Mathematicians pp 183–195Cite as

Birkhäuser

Progress on the Four-Color Theorem

  • Conference paper

Abstract

The four-color theorem, that every loopless planar graph is 4-colorable, was proved in 1977 by Appel and Haken, but there remain open several conjectured extensions. Here we report on a new (but still computer-based) proof of the four-colo theorems itself, and on some progress towards two of the open extensions. We also survey some related results on minors of graphs and on linkless embeddings of graphs in 3-space.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. K. Appel and W. Haken, Every planar map is four colorable. Part I. Discharging, Illinois J. Math. 21 (1977), 429–490.

    MathSciNet  MATH  Google Scholar 

  2. K. Appel and W. Haken, Every Planar Map Is Four Colorable, Amer. Math. Soc. Contemp. Math. 98 (1989).

    Google Scholar 

  3. K. Appel, W. Haken, and J. Koch, Every planar map is four colorable. Part II. Reducibility, Illinois J. Math. 21 (1977), 491–567.

    MathSciNet  MATH  Google Scholar 

  4. T. Böhme, On spatial representations of graphs, Contemporary Methods in Graph Theory, (R. Bodendiek, ed.), BI-Wiss.-Verl. Mannheim, Vienna, Zürich (1990), 151–167.

    Google Scholar 

  5. J. Conway and C. Gordon, Knots and links in spatial graphs, J. Graph Theory 7 (1983), 445–453.

    Article  MathSciNet  Google Scholar 

  6. G. A. Dirac, A property of 4-chromatic graphs and some remarks on critical graphs, J. London Math. Soc. (2) 27 (1952), 85–92.

    Article  MathSciNet  Google Scholar 

  7. B. Grünbaum, Convex Polytopes, Pure and Applied Mathematics, vol. XVI (Wiley-Interscience New York) 1967

    Google Scholar 

  8. H. Hadwiger, Über eine Klassifikation der Streckenkomplexe, Vierteljahrsschr. Naturforsch. Ges. Zürich 88 (1943), 133–142

    MATH  Google Scholar 

  9. L. Jørgensen, Contractions to K 8 , Graph Theory 18 (1994), 431–448.

    Article  MathSciNet  Google Scholar 

  10. H. A. Jung, Eine Verallgemeinerung des n-fachen Zusammenhangs für Graphen, Math. Ann. 187 (1970), 95–103.

    Article  MathSciNet  Google Scholar 

  11. A. K. Kelmans, Finding special subdivisions of K 4 in a graph, in Finite and Infinite Sets. Colloq. Janos Bolyai 37 (1981), 487–508.

    MathSciNet  Google Scholar 

  12. A. Kotzig, Z teorie konečnych pravidelnych grafov tretieho a stvrtého stupna, Časopis Pest. Mat. 82 (1957), 76–92.

    Google Scholar 

  13. K. Kuratowski, Sur le problème des courbes gauches en topologie, Fund. Math. 15(1930), 271–283.

    Article  Google Scholar 

  14. W. Mader, Homomorphiesätze für Graphen, Math. Ann. 178 (1968), 154–168.

    Article  MathSciNet  Google Scholar 

  15. J. Petersen, Die Theorie der regulären Graphen, Acta Math. 15 (1891), 193–220.

    Article  MathSciNet  Google Scholar 

  16. N. Robertson, D. Sanders, P. D. Seymour, and R. Thomas, The four-colour theorem, in preparation.

    Google Scholar 

  17. N. Robertson and P. D. Seymour, Graph minors. IX. Disjoint crossed paths, J. Combin. Theory Ser. B, 49 (1990), 40–77.

    Article  MathSciNet  Google Scholar 

  18. N. Robertson and P. D. Seymour, Graph minors. XVI. Excluding a non-planar graph, submitted.

    Google Scholar 

  19. N. Robertson, P. D. Seyrrrour, and R. Thomas, Tutte’s 3-edge-colouring conjecture, in preparation.

    Google Scholar 

  20. N. Robertson, P. D. Seymour, and R. Thomas, Hadwiger’s conjecture for K s -free graphs, Combinatorica 13 (1993), 279–361.

    Article  MathSciNet  Google Scholar 

  21. N. Robertson, P. D. Seymour, and R. Thomas, Sachs’ linkless embedding conjecture, J. Combin. Theory Ser. B, to appear.

    Google Scholar 

  22. H. Sachs, On spatial representation of finite graphs, in Finite and Infinite Sets, Colloq. Janos Bolyai 37 (1981).

    Google Scholar 

  23. D. G. Seese and W. Wessel, Grids and their minors, J. Combin. Theory Ser. B, 47 (1989), 349–360.

    Article  MathSciNet  Google Scholar 

  24. P. D. Seymour, On multicolourings of cubic graphs, and conjectures of Fulkerson and Tutte, Proc. London Math. Soc. (3) 38 (1979), 423–460.

    Article  MathSciNet  Google Scholar 

  25. P. D. Seymour, Disjoint paths in graphs, Discrete Math. 29 (1980), 293–309.

    Article  MathSciNet  Google Scholar 

  26. P. D. Seymour, Nowhere-zero 6-flows, J. Combin. Theory Ser. B, 30 (1981), 130–135.

    Article  MathSciNet  Google Scholar 

  27. Y. Shiloach, A polynomial solution to the undirected two paths problem, J. Assoc. Comput. Mach. 27 (1980), 445–456.

    Article  MathSciNet  Google Scholar 

  28. E. Steinitz, Polyeder und Raumeinteilungen, Enzykl. Math. Wiss. Part 3AB12, Vol. 3 (1922), 1–139.

    Google Scholar 

  29. E. Steinitz and H. Rademacher, Vorlesung uber die Theorie der Polyeder, Berlin (1934).

    Google Scholar 

  30. P. G. Tait, Note on a theorem in geometry of position, Trans. Roy. Soc. Edinburgh 29 (1880), 657–660.

    Article  Google Scholar 

  31. A. Thomason, An extremal function for contractions of graphs, Math. Proc. Cam-bridge Philos. Soc. 95 (1984), 261–265.

    Article  MathSciNet  Google Scholar 

  32. C. Thomassen, 2-linked graphs, European J. Combin. 1 (1980), 371–378.

    Article  MathSciNet  Google Scholar 

  33. W. T. Tutte, A contribution to the theory of chromatic polynomials, Canad. J. Math. 6 (1954), 80–91.

    Article  MathSciNet  Google Scholar 

  34. K. Wagner, Über eine Eigenschaft der ebenen Komplexe, Math. Ann. 114 (1937), 570–590.

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Bellcore, 445 South Street, Morristown, NJ, 07960, USA

    Paul Seymour

Authors
  1. Paul Seymour
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Département de Mathématiques, EPFL, 1015, Laussane, Switzerland

    S. D. Chatterji

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Birkhäser Verlag, Basel, Switzerland

About this paper

Cite this paper

Seymour, P. (1995). Progress on the Four-Color Theorem. In: Chatterji, S.D. (eds) Proceedings of the International Congress of Mathematicians. Birkhäuser, Basel. https://doi.org/10.1007/978-3-0348-9078-6_14

Download citation

  • DOI: https://doi.org/10.1007/978-3-0348-9078-6_14

  • Publisher Name: Birkhäuser, Basel

  • Print ISBN: 978-3-0348-9897-3

  • Online ISBN: 978-3-0348-9078-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation