On 3-colorable planar graphs without cycles of four lengths

DOI10.1016/j.ipl.2007.03.007zbMath1185.05061OpenAlexW2076057198MaRDI QIDQ2379960

Xiao Fang Luo, Min Chen, Wei Fan Wang

Publication date: 24 March 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2007.03.007

zbMATH Keywords

cyclelengthplanar graphcoloring

Mathematics Subject Classification ID

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

Related Items (max. 100)

Planar graphs without normally adjacent short cycles ⋮ A step towards the strong version of Havel's three color conjecture ⋮ Short proofs of coloring theorems on planar graphs ⋮ On the 3-colorability of planar graphs without 4-, 7- and 9-cycles

Cites Work

• Three-coloring planar graphs without short cycles
• On 3-colorable plane graphs without 5- and 7-cycles
• Planar graphs without cycles of length from 4 to 7 are 3-colorable
• A note on the three color problem
• 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
• Unnamed Item
• Unnamed Item

This page was built for publication: On 3-colorable planar graphs without cycles of four lengths