On 3-colorable planar graphs without short cycles

DOI10.1016/j.aml.2007.10.010zbMath1152.05326OpenAlexW1987285464MaRDI QIDQ998606

Min Chen, Wei Fan Wang

Publication date: 29 January 2009

Published in: Applied Mathematics Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.aml.2007.10.010

zbMATH Keywords

facecycleplanar graphschromatic numbercoloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items

Facially-constrained colorings of plane graphs: a survey ⋮ A step towards the strong version of Havel's three color conjecture ⋮ Short proofs of coloring theorems on planar graphs

Cites Work

• Unnamed Item
• Unnamed Item
• 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
• On 3-colorable planar graphs without prescribed cycles
• 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