On 3-colorable planar graphs without prescribed cycles

DOI10.1016/j.disc.2006.11.025zbMath1128.05025OpenAlexW1980396867MaRDI QIDQ2461207

Min Chen, Wei Fan Wang

Publication date: 27 November 2007

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

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

zbMATH Keywords

cycleplanar graphcoloring

Mathematics Subject Classification ID

Paths and cycles (05C38) 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 3-colorable planar graphs without short cycles ⋮ Planar graphs without cycles of length 4, 5, 8, or 9 are 3-choosable

Cites Work

• 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 prescribed cycles