Three-colourability of planar graphs with no 5- or triangular \(\{3,6\}\)-cycles

DOI10.1016/J.ENDM.2015.07.068zbMath1347.05061OpenAlexW2215903888MaRDI QIDQ324868

Babak Farzad, Asiyeh Sanaei

Publication date: 17 October 2016

Full work available at URL: https://doi.org/10.1016/j.endm.2015.07.068

zbMATH Keywords

planar graphsgraph colouringSteinberg conjecture

Mathematics Subject Classification ID

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

Cites Work

• Planar graphs without 5- and 7-cycles and without adjacent triangles are 3-colorable
• Colorings of plane graphs: a survey

This page was built for publication: Three-colourability of planar graphs with no 5- or triangular \(\{3,6\}\)-cycles