A Grötzsch-Type Theorem for List Colourings with Impropriety One
From MaRDI portal
Publication:4934788
DOI10.1017/S096354839900396XzbMath0941.05027OpenAlexW2120784503MaRDI QIDQ4934788
Publication date: 3 August 2000
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s096354839900396x
Related Items (12)
\((3, 1)^*\)-choosability of graphs of nonnegative characteristic without intersecting short cycles ⋮ A \((3,1)^\ast\)-choosable theorem on planar graphs ⋮ Improper choosability of graphs of nonnegative characteristic ⋮ Improper Choosability and Property B ⋮ Planar graphs with cycles of length neither 4 nor 6 are \((2,0,0)\)-colorable ⋮ Decomposing a planar graph without cycles of length 5 into a matching and a 3-colorable graph ⋮ On generalized choice and coloring numbers ⋮ Acyclic improper choosability of subcubic graphs ⋮ A note on list improper coloring planar graphs ⋮ A note on list improper coloring of plane graphs ⋮ On \((3, 1)^\ast\)-choosability of planar graphs without adjacent short cycles ⋮ ON (3, 1)*-CHOOSABILITY OF TOROIDAL GRAPHS
This page was built for publication: A Grötzsch-Type Theorem for List Colourings with Impropriety One
