On the 3-colorability of planar graphs without 4-, 7- and 9-cycles

DOI10.1016/j.disc.2009.02.030zbMath1209.05092OpenAlexW2055901320MaRDI QIDQ1043995

Yuehua Bu, Hua Jing Lu, Andre Raspaud, Ying Qian Wang, Wei Fan Wang, Mickaël Montassier

Publication date: 10 December 2009

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

Full work available at URL: https://doi.org/10.1016/j.disc.2009.02.030

zbMATH Keywords

cyclesplanar graphsextendabilitycoloring

Mathematics Subject Classification ID

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

Related Items (4)

Plane Graphs without 4- and 5-Cycles and without Ext-Triangular 7-Cycles are 3-Colorable ⋮ \((1,0,0)\)-colorability of planar graphs without prescribed short cycles ⋮ The 3-colorability of planar graphs without cycles of length 4, 6 and 9 ⋮ \((1,0,0)\)-colorability of planar graphs without cycles of length \(4\) or \(6\)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Planar graphs without cycles of length 4, 7, 8, or 9 are 3-choosable
• Three-coloring planar graphs without short cycles
• On 3-colorable plane graphs without 5- and 7-cycles
• Planar graphs without 5- and 7-cycles and without adjacent triangles are 3-colorable
• Planar graphs without cycles of length from 4 to 7 are 3-colorable
• A note on the three color problem
• On 3-colorable planar graphs without cycles of four lengths
• A sufficient condition for a planar graph to be 3-choosable
• A note on 3-choosability of planar graphs
• Planar graphs without 4, 6, 8-cycles are 3-colorable
• A note on 3-choosability of planar graphs without certain cycles
• Structural properties of plane graphs without adjacent triangles and an application to 3-colorings
• 25 pretty graph colouring problems

This page was built for publication: On the 3-colorability of planar graphs without 4-, 7- and 9-cycles