Irreducible graphs in the Grünbaum-Havel 3-colour problem

DOI10.1016/0012-365X(95)00114-CzbMath0859.05041OpenAlexW2001074885MaRDI QIDQ1126208

Oleg V. Borodin

Publication date: 8 December 1996

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

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

zbMATH Keywords

planar graphquadrangletrianglesminimal distanceGrünbaum-Havel problem

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (1)

Three-coloring triangle-free graphs on surfaces. V: Coloring planar graphs with distant anomalies

Cites Work

• Some counterexamples associated with the three-color problem
• Grötzsch's theorem on 3-colorings
• On a conjecture of B. Grünbaum
• Unnamed Item
• Unnamed Item

This page was built for publication: Irreducible graphs in the Grünbaum-Havel 3-colour problem