The four color proof suffices

DOI10.1007/BF03023914zbMath0578.05022MaRDI QIDQ1066155

Wolfgang Haken, Kenneth I. Appel

Publication date: 1986

Published in: The Mathematical Intelligencer (Search for Journal in Brave)

zbMATH Keywords

configurationsplanar triangulationKempe chainFour Color Theoremunavoidable set of reducible

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items

A categorical setting for the 4-colour theorem ⋮ Responses to ``Theoretical Mathematics: Toward\\ a cultural synthesis of mathematics and\\ theoretical physics, by A. Jaffe and F. Quinn ⋮ Vertex-edge marking score of certain triangular lattices ⋮ Ugly mathematics: why do mathematicians dislike computer-assisted proofs? ⋮ Formally proving size optimality of sorting networks ⋮ Mod 3 arithmetic on triangulated Riemann surfaces ⋮ A revision of the proof of the Kepler conjecture ⋮ Colouring the discretization graphs arising in the multigrid method

Cites Work

• Unnamed Item
• The four-color theorem for small maps
• Every planar map is four colorable. I: Discharging
• Every planar map is four colorable. II: Reducibility
• A systematic approach to the determination of reducible configurations in the four-color conjecture
• Chromatic reduction of the triangulations \(T_e, e=e_5+e_7\)

This page was built for publication: The four color proof suffices