A new proof of Grünbaum's 3 color theorem

DOI10.1016/0012-365X(95)00984-5zbMath0882.05059OpenAlexW2045903428MaRDI QIDQ1357735

Oleg V. Borodin

Publication date: 16 June 1997

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(95)00984-5

zbMATH Keywords

planar graph3-colour theorem

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)

Related Items

Superposition and constructions of graphs without nowhere-zero \(k\)-flows ⋮ Further extensions of the Grötzsch theorem ⋮ 3-coloring triangle-free planar graphs with a precolored 9-cycle ⋮ 3-Coloring Triangle-Free Planar Graphs with a Precolored 9-Cycle ⋮ Short proofs of coloring theorems on planar graphs ⋮ Ore's conjecture on color-critical graphs is almost true ⋮ Splitting a planar graph of girth 5 into two forests with trees of small diameter ⋮ Three-coloring triangle-free graphs on surfaces. V: Coloring planar graphs with distant anomalies ⋮ Planar 4-critical graphs with four triangles ⋮ Fractional Coloring Methods with Applications to Degenerate Graphs and Graphs on Surfaces

Cites Work

• On acyclic colorings of planar graphs
• Grötzsch's theorem on 3-colorings
• 25 pretty graph colouring problems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item