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

DOI10.1016/J.ENDM.2015.07.068zbMATH Open1347.05061OpenAlexW2215903888MaRDI QIDQ324868FDOQ324868

Authors: Babak Farzad, Asiyeh Sanaei 

Publication date: 17 October 2016

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

Recommendations

• The \((3, 3)\)-colorability of planar graphs without 4-cycles and 5-cycles
• On 3-colorable planar graphs without prescribed cycles
• Three-coloring planar graphs without short cycles
• The 3-colorability of planar graphs without cycles of length 4, 6 and 9
• On 3-colorable plane graphs without 5- and 7-cycles
• On 3-colorable planar graphs without short cycles
• On 3-colorability of planar graphs without adjacent short cycles
• Planar graphs without 5- and 7-cycles and without adjacent triangles are 3-colorable
• On 3-colorable planar graphs without cycles of four lengths
• On the 3-colorability of planar graphs without 4-, 7- and 9-cycles

zbMATH Keywords

planar graphsgraph colouringSteinberg conjecture

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (10)

• Three coloring via triangle counting
• Decomposing a planar graph without cycles of length 5 into a matching and a 3-colorable graph
• The 3-colorability of planar graphs without cycles of length 4, 6 and 9
• A note on the three color problem on planar graphs without 4- and 5-cycles and without ext-triangular 7-cycles
• Three-coloring planar graphs without short cycles
• Cycle adjacency of planar graphs and 3-colourability
• Do triangle-free planar graphs have exponentially many 3-colorings?
• New restrictions on defective coloring with applications to Steinberg-type graphs
• A relaxation of Novosibirsk 3-color conjecture
• Triangle-free planar graphs with at most \(64^{n^{0.731}}\) 3-colorings

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

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