Progress on the Four-Color Theorem

Paul Seymour

A chapter in Proceedings of the International Congress of Mathematicians, 1995, pp 183-195 from Springer

Abstract: 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.

Date: 1995
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-0348-9078-6_14

Ordering information: This item can be ordered from
http://www.springer.com/9783034890786

DOI: 10.1007/978-3-0348-9078-6_14

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().