The 3-colorability of planar graphs without cycles of length 4, 6 and 9

DOI10.1016/J.DISC.2015.08.023zbMath1322.05043arXiv1506.04629OpenAlexW1593750691MaRDI QIDQ501066

Ying Qian Wang, Li-Gang Jin, Ying-Li Kang

Publication date: 8 October 2015

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

Full work available at URL: https://arxiv.org/abs/1506.04629

zbMATH Keywords

vertex coloringplanar graphSteinberg's conjecture

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 (7)

Plane Graphs without 4- and 5-Cycles and without Ext-Triangular 7-Cycles are 3-Colorable ⋮ Partitioning planar graphs without 4-cycles and 5-cycles into two forests with a specific condition ⋮ A weak DP-partitioning of planar graphs without 4-cycles and 6-cycles ⋮ Planar graphs with cycles of length neither 4 nor 6 are \((2,0,0)\)-colorable ⋮ \((1,0,0)\)-colorability of planar graphs without prescribed short cycles ⋮ \((1,0,0)\)-colorability of planar graphs without cycles of length \(4\) or \(6\) ⋮ Planar graphs without short even cycles are near-bipartite

Cites Work

• Unnamed Item
• Unnamed Item
• Planar graphs without triangles adjacent to cycles of length from 4 to 7 are 3-colorable
• On 3-colorable plane graphs without 5- and 7-cycles
• Planar graphs without 5- and 7-cycles and without adjacent triangles are 3-colorable
• On the 3-colorability of planar graphs without 4-, 7- and 9-cycles
• Planar graphs without cycles of length from 4 to 7 are 3-colorable
• A note on the three color problem
• Planar graphs without 4, 6, 8-cycles are 3-colorable
• A NOTE ON 3-COLORABLE PLANE GRAPHS WITHOUT 5- AND 7-CYCLES
• Structural properties of plane graphs without adjacent triangles and an application to 3-colorings

This page was built for publication: The 3-colorability of planar graphs without cycles of length 4, 6 and 9