scientific article; zbMATH DE number 1021588

DOI10.1090/S1079-6762-96-00003-0zbMath0865.05039MaRDI QIDQ4340879

Robin Thomas, Neil Robertson, Daniel P. Sanders, P. D. Seymour

Publication date: 15 June 1997

Published in: Electronic Research Announcements of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/231876

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

planar graphfour-colour theorem

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items

On the dichromatic number of surfaces ⋮ Book review of: U. Montano, Explaining beauty in mathematics: an aesthetic theory of mathematics ⋮ A note on not-4-list colorable planar graphs ⋮ The challenge of computer mathematics ⋮ Even-cycle decompositions of graphs with no odd-\(K_4\)-minor ⋮ Colorings with neighborhood parity condition ⋮ Remarks on odd colorings of graphs ⋮ New restrictions on defective coloring with applications to Steinberg-type graphs ⋮ A note on odd colorings of 1-planar graphs ⋮ The degree/diameter problem in maximal planar bipartite graphs ⋮ Optimizing phylogenetic diversity with ecological constraints ⋮ Proof of Conway’s lost cosmological theorem ⋮ Network pollution games ⋮ Binary pattern tile set synthesis is NP-hard ⋮ The thickness and chromatic number of \(r\)-inflated graphs ⋮ A self-stabilizing algorithm for the maximum planarization problem in complete bipartite networks ⋮ Optimizing phylogenetic diversity across two trees ⋮ Coloring of Plane Graphs with Unique Maximal Colors on Faces ⋮ Thickness-two graphs. II: More new nine-critical graphs, independence ratio, cloned planar graphs, and singly and doubly outerplanar graphs ⋮ REOPTIMIZATION UNDER VERTEX INSERTION: MAX P_k-FREE SUBGRAPH AND MAX PLANAR SUBGRAPH ⋮ deBruijn-like sequences and the irregular chromatic number of paths and cycles ⋮ Antisymmetric flows and strong colourings of oriented graphs ⋮ Some Conjectures and Questions in Chromatic Topological Graph Theory ⋮ Coloring face-hypergraphs of graphs on surfaces ⋮ On local transformation of polygons with visibility properties.

Cites Work

• Every planar map is four colorable. I: Discharging
• A systematic approach to the determination of reducible configurations in the four-color conjecture
• The four-colour theorem
• Every Planar Map is Four Colorable
• Another Reducible Edge Configuration
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item