Plane graphs without cycles of length 4, 6, 7 or 8 are 3-colorable

DOI10.1016/j.disc.2007.07.099zbMath1203.05060OpenAlexW1966561827MaRDI QIDQ932660

Liang Shen, Ming Chen, Ying Qian Wang

Publication date: 11 July 2008

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

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

zbMATH Keywords

cyclesplane graph3-colorable

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items

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
• Unnamed Item
• Unnamed Item