Planar graphs without 4, 6, 8-cycles are 3-colorable

DOI10.1007/s11425-007-0106-4zbMath1144.05033OpenAlexW2110837514MaRDI QIDQ2475310

Min Chen, Wei Fan Wang

Publication date: 11 March 2008

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

Full work available at URL: https://doi.org/10.1007/s11425-007-0106-4

zbMATH Keywords

cycleplanar graphscoloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (max. 100)

Planar graphs without normally adjacent short cycles ⋮ Characterization of Cycle Obstruction Sets for Improper Coloring Planar Graphs ⋮ Planar graphs without \(\{4, 6, 8\}\)-cycles are 3-choosable ⋮ A step towards the strong version of Havel's three color conjecture ⋮ 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 ⋮ Short proofs of coloring theorems on planar graphs ⋮ 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 ⋮ The 3-colorability of planar graphs without cycles of length 4, 6 and 9 ⋮ Planar graphs without short even cycles are near-bipartite ⋮ On the 3-colorability of planar graphs without 4-, 7- and 9-cycles

Cites Work

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

This page was built for publication: Planar graphs without 4, 6, 8-cycles are 3-colorable