Every planar map is four colorable. Part II: Reducibility

1977/09/01 by K. I. Appel, Wolfgang Haken, J. Koch · 14 citations
Engineering · Computer Science · #3D Modeling in Geospatial Applications #Computational Geometry and Mesh Generation

paper · pdf · doi:10.1215/ijm/1256049012

openalex publication_date 1977/09/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/04

Abstract

computer of the University Administrative Data Processing Unit. We should like to especially thank the consultants and systems programmers at C.S.O. for their excellent help and advice and the

Cited by

• The book thickness of a graph
• Algorithmic Graph Minor Theory: Decomposition, Approximation, and Coloring
• An Erdős-Pósa theorem for cycles and faces of distinct lengths
• The State of the Three Color Problem
• Local Weak Degeneracy of Planar Graphs
• The Nature of Computation
• Invitation to Fixed-Parameter Algorithms
• Edge-colouring eight-regular planar graphs
• Three-edge-colouring doublecross cubic graphs
• The Continuing Saga of Snarks
• Solving Hard Computational Problems Efficiently: Asymptotic Parametric Complexity 3-Coloring Algorithm
• Chromatic roots are dense in the whole complex plane
• Note on coloring graphs without odd-Kk-minors
• Four color theorem [wikipedia]
• Graph theory [wikipedia]