Publication:2760437
From MaRDI portal
zbMath0979.05039MaRDI QIDQ2760437
Publication date: 2 January 2002
05C15: Coloring of graphs and hypergraphs
Related Items
Toroidal graphs containing neither nor 6‐cycles 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, Choosability of toroidal graphs without short cycles