Planar Graphs without 7-Cycles Are 4-Choosable
From MaRDI portal
Publication:3583295
DOI10.1137/05064477XzbMath1207.05052MaRDI QIDQ3583295
Publication date: 27 August 2010
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Related Items (20)
Two sufficient conditions for a planar graph to be list vertex-2-arborable ⋮ Planar graphs without intersecting 5-cycles are 4-choosable ⋮ \((4,2)\)-choosability of planar graphs with forbidden structures ⋮ Planar graphs without 7-cycles and butterflies are DP-4-colorable ⋮ A sufficient condition for planar graphs to be DP-4-colorable ⋮ 4-choosability of planar graphs with 4-cycles far apart via the Combinatorial Nullstellensatz ⋮ 不含带弦6-圈和项链图的平面图是DP-4-可染的 ⋮ On the vertex-arboricity of planar graphs without 7-cycles ⋮ DP-4-coloring of planar graphs with some restrictions on cycles ⋮ The 4-choosability of planar graphs and cycle adjacency ⋮ Planar graphs without chordal 6-cycles are 4-choosable ⋮ A sufficient condition for a planar graph to be 4-choosable ⋮ Choosability of toroidal graphs without short cycles ⋮ List coloring and diagonal coloring for plane graphs of diameter two ⋮ Planar graphs without 4-cycles adjacent to triangles are 4-choosable ⋮ DP-4-colorability of planar graphs without adjacent cycles of given length ⋮ Cover and variable degeneracy ⋮ Planar graphs without pairwise adjacent 3-, 4-, 5-, and 6-cycle are 4-choosable ⋮ DP-coloring on planar graphs without given adjacent short cycles ⋮ Toroidal graphs containing neither nor 6‐cycles are 4‐choosable
This page was built for publication: Planar Graphs without 7-Cycles Are 4-Choosable
