scientific article; zbMATH DE number 1021588

DOI10.1090/S1079-6762-96-00003-0MaRDI QIDQ4340879zbMATH OpenFDO

Authors Neil Robertson, Daniel P. Sanders, Robin Thomas, Paul 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

zbMATH Keywords

four-colour theoremplanar graph

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)

Recommendations

• The four-colour theorem
• scientific article; zbMATH DE number 849955
• scientific article; zbMATH DE number 866017
• scientific article; zbMATH DE number 1564003

Cites work

• A systematic approach to the determination of reducible configurations in the four-color conjecture
• Another Reducible Edge Configuration
• Every Planar Map is Four Colorable
• Every planar map is four colorable. I: Discharging
• scientific article; zbMATH DE number 140087 (Why is no real title available?)
• scientific article; zbMATH DE number 3513805 (Why is no real title available?)
• scientific article; zbMATH DE number 3797779 (Why is no real title available?)
• scientific article; zbMATH DE number 3298600 (Why is no real title available?)
• The four-colour theorem

Cited in

(55)

• Optimizing phylogenetic diversity across two trees
• Thickness-two graphs. II: More new nine-critical graphs, independence ratio, cloned planar graphs, and singly and doubly outerplanar graphs
• deBruijn-like sequences and the irregular chromatic number of paths and cycles
• Antisymmetric flows and strong colourings of oriented graphs
• A new proof of Grünbaum's 3 color theorem
• The four-colour theorem
• A note on not-4-list colorable planar graphs
• Network pollution games
• Coloring face-hypergraphs of graphs on surfaces
• On local transformation of polygons with visibility properties.
• A categorical setting for the 4-colour theorem
• Clifford algebra and 4-color theorem
• On the dichromatic number of surfaces
• Colorings with neighborhood parity condition
• Remarks on odd colorings of graphs
• New restrictions on defective coloring with applications to Steinberg-type graphs
• Linear algebraic approach to an edge-coloring result
• Book review of: U. Montano, Explaining beauty in mathematics: an aesthetic theory of mathematics
• Even-cycle decompositions of graphs with no odd-K₄-minor
• A note on odd colorings of 1-planar graphs
• A note on the four color theorem
• Coloring of plane graphs with unique maximal colors on faces
• Reoptimization under vertex insertion: max \(P_{k}\)-free subgraph and max planar subgraph
• An unavoidable set of D-reducible configurations
• The complexity of the four colour theorem
• scientific article; zbMATH DE number 3851119 (Why is no real title available?)
• scientific article; zbMATH DE number 4160756 (Why is no real title available?)
• The Four Colour Theorem: Engineering of a Formal Proof
• scientific article; zbMATH DE number 4095493 (Why is no real title available?)
• scientific article; zbMATH DE number 140087 (Why is no real title available?)
• scientific article; zbMATH DE number 1196612 (Why is no real title available?)
• scientific article; zbMATH DE number 1212381 (Why is no real title available?)
• scientific article; zbMATH DE number 1293306 (Why is no real title available?)
• Proof of Conway’s lost cosmological theorem
• scientific article; zbMATH DE number 2076921 (Why is no real title available?)
• scientific article; zbMATH DE number 1927415 (Why is no real title available?)
• scientific article; zbMATH DE number 1529471 (Why is no real title available?)
• scientific article; zbMATH DE number 1564003 (Why is no real title available?)
• One Probabilistic Equivalent of the Four Color Conjecture
• A new proof of the 6 color theorem
• scientific article; zbMATH DE number 849955 (Why is no real title available?)
• scientific article; zbMATH DE number 915267 (Why is no real title available?)
• One More Probabilistic Reformulation of the Four Colour Conjecture
• The challenge of computer mathematics
• Formal proof - the four color theorem
• Some Conjectures and Questions in Chromatic Topological Graph Theory
• The degree/diameter problem in maximal planar bipartite graphs
• On the map theorem
• Optimizing phylogenetic diversity with ecological constraints
• Kempe classes and almost bipartite graphs
• Accepted proofs: objective truth, or culturally robust?
• On odd and strong odd colorings of graphs
• The thickness and chromatic number of \(r\)-inflated graphs
• On a conjecture about the strong odd chromatic number of planar graphs
• A self-stabilizing algorithm for the maximum planarization problem in complete bipartite networks

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4340879)