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)
05C10: Planar graphs; geometric and topological aspects of graph theory
05C15: Coloring of graphs and hypergraphs
Related Items
DP-coloring on planar graphs without given adjacent short cycles, Toroidal graphs containing neither nor 6‐cycles are 4‐choosable, On the vertex-arboricity of planar graphs without 7-cycles, A sufficient condition for a planar graph to be 4-choosable, Planar graphs without 4-cycles adjacent to triangles are 4-choosable, Planar graphs without chordal 6-cycles are 4-choosable, DP-4-coloring of planar graphs with some restrictions on cycles, The 4-choosability of planar graphs and cycle adjacency, Cover and variable degeneracy, Planar graphs without pairwise adjacent 3-, 4-, 5-, and 6-cycle are 4-choosable, Two sufficient conditions for a planar graph to be list vertex-2-arborable, Planar graphs without 7-cycles and butterflies are DP-4-colorable, List coloring and diagonal coloring for plane graphs of diameter two, DP-4-colorability of planar graphs without adjacent cycles of given length, Planar graphs without intersecting 5-cycles are 4-choosable, \((4,2)\)-choosability of planar graphs with forbidden structures, Choosability of toroidal graphs without short cycles
