The State of the Three Color Problem

1993/01/01 by Richard Steinberg · 4 citations
Computer Science · Engineering · Mathematics · #Art #Art history #Colored #Computational Geometry and Mesh Generation #Extant taxon #Law #Mathematics #Mathematics and Applications #Philosophy #Political science #graph theory and CDMA systems

paper · doi:10.1016/s0167-5060(08)70391-1

crossref issued 1993/01/01 · crossref published 1993/01/01 · crossref published-print 1993/01/01 · openalex publication_date 1993/01/01 · crossref created 2008/05/01 · crossref deposited 2019/05/11 · openalex created_date 2025/10/10 · crossref indexed 2026/08/02 · openalex updated_date 2026/08/02

Citations

• Every planar map is four colorable. Part II: Reducibility
• Every planar map is four colorable. Part I: Discharging
• Sur le coloriage des graphs
• A Contribution to the Theory of Chromatic Polynomials
• On the Geographical Problem of the Four Colours
• 10. Remarks on the previous Communication
• On the Colouring of Maps
• Some simplified NP-complete graph problems
• A short proof of Chvátal's Watchman Theorem
• A Theorem of R. L. Brooks and a Conjecture of H. Hadwiger
• Intersection graphs of curves in the plane
• A combinatorial theorem in plane geometry
• The linear arboricity of graphs
• Every planar map is four colorable
• Graph Theory and Probability

Cited by

• Solving Hard Computational Problems Efficiently: Asymptotic Parametric Complexity 3-Coloring Algorithm
• Planar 4-critical graphs with four triangles
• Planar graphs without 5-cycles and intersecting triangles are (1,1,0)-colorable
• Four color theorem [wikipedia]