On 3-colorability of planar graphs without adjacent short cycles

DOI10.1007/s11425-010-0074-yzbMath1194.05045OpenAlexW1986043258MaRDI QIDQ977289

Xiang Hua Mao, Ying Qian Wang, Wei Fan Wang, Hua Jing Lu

Publication date: 21 June 2010

Published in: Science China. Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11425-010-0074-y

zbMATH Keywords

cycleextensionplanar graphcoloring

Mathematics Subject Classification ID

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

Related Items (max. 100)

Facially-constrained colorings of plane graphs: a survey ⋮ Class I graphs of nonnegative characteristic without special cycles ⋮ A step towards the strong version of Havel's three color conjecture ⋮ Short proofs of coloring theorems on planar graphs ⋮ Distance constraints on short cycles for 3-colorability of planar graphs ⋮ Planar graphs without adjacent cycles of length at most five are \((1,1,0)\)-colorable

Cites Work

• Planar graphs without cycles of length from 4 to 7 are 3-colorable
• A note on the three color problem
• Structural properties of plane graphs without adjacent triangles and an application to 3-colorings
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On 3-colorability of planar graphs without adjacent short cycles