Short proofs of coloring theorems on planar graphs

DOI10.1016/j.ejc.2013.05.002zbMath1284.05090arXiv1211.3981OpenAlexW2149867990MaRDI QIDQ2441638

Oleg V. Borodin, Bernard Lidický, Matthew P. Yancey, Alexandr V. Kostochka

Publication date: 25 March 2014

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1211.3981

zbMATH Keywords

3-colorableplanar triangle-free graph

Mathematics Subject Classification ID

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

Related Items (8)

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 ⋮ Unnamed Item ⋮ Ore's conjecture on color-critical graphs is almost true ⋮ A Brooks-type result for sparse critical graphs ⋮ Note on 3-choosability of planar graphs with maximum degree 4 ⋮ Adynamic coloring of graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Ore's conjecture for \(k=4\) and Grötzsch's theorem
• Ore's conjecture on color-critical graphs is almost true
• Planar graphs without triangles adjacent to cycles of length from 4 to 7 are 3-colorable
• Three-coloring planar graphs without short cycles
• On 3-colorable plane graphs without 5- and 7-cycles
• On 3-colorability of planar graphs without adjacent short cycles
• On 3-colorable planar graphs without short cycles
• Planar graphs without 5- and 7-cycles and without adjacent triangles are 3-colorable
• Planar graphs without adjacent cycles of length at most seven are 3-colorable
• Grötzsch's 3-color theorem and its counterparts for the torus and the projective plane
• A new proof of Grünbaum's 3 color theorem
• Planar graphs without cycles of length from 4 to 7 are 3-colorable
• Three-coloring Klein bottle graphs of girth five
• Colorings of plane graphs: a survey
• On 3-colorable planar graphs without cycles of four lengths
• On 3-colorable planar graphs without prescribed cycles
• Planar graphs without 4, 6, 8-cycles are 3-colorable
• Grötzsch's theorem on 3-colorings
• A Theorem of R. L. Brooks and a Conjecture of H. Hadwiger
• The color space of a graph
• 4-chromatic projective graphs
• On a conjecture of B. Grünbaum

This page was built for publication: Short proofs of coloring theorems on planar graphs