scientific article; zbMATH DE number 1500612

MaRDI QIDQ4501634zbMATH OpenFDO

Authors Olivier Hudry

Publication date 12 February 2001

zbMATH Keywords

computer assisted proofsmap coloringplanar graph coloring

Mathematics Subject Classification ID

History of mathematics in the 19th century (01A55) History of mathematics in the 20th century (01A60) History of combinatorics (05-03) Coloring of graphs and hypergraphs (05C15)

Review text

A survey of the four-colour problem: an outline of its history from 1852 till 1997 with the relevant bibliographical data, a presentation of the way which eventually led K. Haken and W. Appel to the computer assisted conquest in 1976, main points of the ensuing debate, initiated by T. Tymoczko in 1979, on the relevance of computers in pure mathematics. Written in a rather informal style, the survey is easy to read. For the entire collection see [Zbl 0940.00005].

Recommendations

• scientific article; zbMATH DE number 1926591
• scientific article; zbMATH DE number 4160756
• The four-color theorem. History, topological foundations, and idea of proof. Transl. from the German by Julie Peschke
• The four-colour theorem

Cited in

(9)

• C. S. Peirce and De Morgan on the four-colour conjecture
• Variable neighborhood search for extremal graphs. V: Three ways to automate finding conjectures
• Wolfgang Haken and the four-color problem
• scientific article; zbMATH DE number 1926591 (Why is no real title available?)
• A note on the history of the four-colour conjecture
• scientific article; zbMATH DE number 6965186 (Why is no real title available?)
• scientific article; zbMATH DE number 3241107 (Why is no real title available?)
• The plurality problem with three colors and more.
• Map-coloring problems

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4501634)