Every Planar Map is Four Colorable
From MaRDI portal
Publication:3993359
DOI10.1090/conm/098zbMath0681.05027OpenAlexW4301890399WikidataQ55899213 ScholiaQ55899213MaRDI QIDQ3993359
Wolfgang Haken, Kenneth I. Appel
Publication date: 17 September 1992
Published in: Contemporary Mathematics (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/3d5072364f230e1ab5a0b3725d84d15689615077
Related Items
Properties of chromatic polynomials of hypergraphs not held for chromatic polynomials of graphs ⋮ Clustered 3-colouring graphs of bounded degree ⋮ A proof via finite elements for Schiffer's conjecture on a regular pentagon ⋮ Three-coloring triangle-free graphs on surfaces. I: Extending a coloring to a disk with one triangle. ⋮ On a Heawood-type problem for maps with tangencies ⋮ Facial incidence colorings of embedded multigraphs ⋮ Formalizing Frankl’s Conjecture: FC-Families ⋮ A note on not-4-list colorable planar graphs ⋮ Discovering boundary algebra: A simple notation for Boolean algebra and the truth functors ⋮ Six-Critical Graphs on the Klein Bottle ⋮ Introduction to rigorous numerics in dynamics: General functional analytic setup and an example that forces chaos ⋮ Transfer matrices and partition-function zeros for antiferromagnetic Potts models. V. Further results for the square-lattice chromatic polynomial ⋮ Construction of fullerenes and Pogorelov polytopes with 5-, 6- and one 7-gonal face ⋮ The four-colour theorem ⋮ Lie algebras and the four color theorem ⋮ Reflexive coloring complexes for 3-edge-colorings of cubic graphs ⋮ Complexity of 3-edge-coloring in the class of cubic graphs with a polyhedral embedding in an orientable surface ⋮ Big Math and the one-brain barrier: the tetrapod model of mathematical knowledge ⋮ Challenges to the assessment of time-to-proof of mathematical conjectures ⋮ Proper orientations and proper chromatic number ⋮ Wheels in planar graphs and Hajós graphs ⋮ 4‐Separations in Hajós graphs ⋮ Computer Bounds for Kronheimer–Mrowka Foam Evaluation ⋮ On word-representable and multi-word-representable graphs ⋮ Computer-assisted estimates for Birkhoff normal forms ⋮ Parity vertex colouring of plane graphs ⋮ Strengthening a Theorem of Meyniel ⋮ Local Hadwiger's conjecture ⋮ Right-angled polyhedra and hyperbolic 3-manifolds ⋮ Coverage with \(k\)-transmitters in the presence of obstacles ⋮ Speaking to the public: mathematicians on American radio, the 1920s through the 1940s ⋮ Signature and concordance of positive knots ⋮ Light graphs in planar graphs of large girth ⋮ Computer-assisted proof of performance ratios for the differencing method ⋮ Information-sharing in social networks ⋮ Nowhere–zero bases for the nullspace of the incidence matrices of graphs ⋮ From the plane to higher surfaces ⋮ A Survey on the Computational Complexity of Coloring Graphs with Forbidden Subgraphs ⋮ Foam evaluation and Kronheimer-Mrowka theories ⋮ Variable neighborhood search for extremal graphs. V: Three ways to automate finding conjectures ⋮ Zero-sum flows of the linear lattice. ⋮ Looseness of plane graphs ⋮ Polynomial hierarchy graph properties in hybrid logic ⋮ Finding the exact bound of the maximum degrees of class two graphs embeddable in a surface of characteristic \(\epsilon \in \{-1, -2, -3\}\) ⋮ Unnamed Item ⋮ Improved bounds for guarding plane graphs with edges ⋮ Organizing volumes of right-angled hyperbolic polyhedra ⋮ Steinberg-like theorems for backbone colouring ⋮ An introduction to the discharging method via graph coloring ⋮ Separating sets of strings by finding matching patterns is almost always hard ⋮ One More Probabilistic Reformulation of the Four Colour Conjecture ⋮ The extremal function and Colin de Verdière graph parameter ⋮ Locally planar graphs are 5-choosable ⋮ Linear algebraic approach to an edge-coloring result ⋮ Network pollution games ⋮ Tait colorings, and an instanton homology for webs and foams ⋮ A deformation of instanton homology for webs ⋮ Cyclic, diagonal and facial colorings ⋮ Some arithmetical restatements of the four color conjecture ⋮ Mod 3 arithmetic on triangulated Riemann surfaces ⋮ Five-coloring graphs on the Klein bottle ⋮ Maximal distance spectral radius of 4-chromatic planar graphs ⋮ Hopf algebras and the Penrose polynomial ⋮ An unavoidable set of $D$-reducible configurations ⋮ 3-Regular Non 3-Edge-Colorable Graphs with Polyhedral Embeddings in Orientable Surfaces ⋮ Simple graphs of order 12 and minimum degree 6 contain \(K_6\) minors ⋮ Polyhedral embeddings of snarks in orientable surfaces ⋮ Nowhere-zero 4-flow in almost Petersen-minor free graphs ⋮ A bound on the chromatic number of an almost planar graph ⋮ TWO-SIDED ASYMPTOTIC BOUNDS FOR THE COMPLEXITY OF SOME CLOSED HYPERBOLIC THREE-MANIFOLDS ⋮ Volume estimates for equiangular hyperbolic Coxeter polyhedra ⋮ Open Problems on Graph Coloring for Special Graph Classes ⋮ A general upper bound for the cyclic chromatic number of 3‐connected plane graphs ⋮ Some probabilistic restatements of the Four Color Conjecture ⋮ Subcubic triangle-free graphs have fractional chromatic number at most 14/5 ⋮ Unnamed Item ⋮ Vivid: a framework for heterogeneous problem solving ⋮ Choosability, edge choosability and total choosability of outerplane graphs ⋮ Edge colorings of graphs embeddable in a surface of low genus ⋮ On cyclic colorings and their generalizations ⋮ Transition polynomials ⋮ Surfaces, tree-width, clique-minors, and partitions ⋮ Coloring the faces of convex polyhedra so that like colors are far apart ⋮ Political districting to minimize cut edges ⋮ Improved bounds for guarding plane graphs with edges ⋮ Computers and discovery in algebraic graph theory ⋮ A self-stabilizing algorithm for coloring planar graphs ⋮ On Vertex Partitions and the Colin de Verdière Parameter ⋮ Say no to case analysis: automating the drudgery of case-based proofs
