List improper colorings of planar graphs with prescribed girth
From MaRDI portal
Publication:1972143
DOI10.1016/S0012-365X(99)00145-4zbMath0940.05027OpenAlexW2083796113MaRDI QIDQ1972143
Publication date: 22 June 2000
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0012-365x(99)00145-4
Related Items (25)
Every planar graph with girth at least 5 is \((1,9)\)-colorable ⋮ \((3, 1)^*\)-choosability of graphs of nonnegative characteristic without intersecting short cycles ⋮ Path choosability of planar graphs ⋮ A \((3,1)^\ast\)-choosable theorem on planar graphs ⋮ Improper choosability of graphs of nonnegative characteristic ⋮ Characterization of Cycle Obstruction Sets for Improper Coloring Planar Graphs ⋮ Improper Choosability and Property B ⋮ Colouring planar graphs with bounded monochromatic components ⋮ Partitioning sparse graphs into an independent set and a graph with bounded size components ⋮ An (F1,F4)‐partition of graphs with low genus and girth at least 6 ⋮ Every planar graph without 4-cycles and 5-cycles is (3,3)-colorable ⋮ Sparse critical graphs for defective DP-colorings ⋮ (1,k)-Coloring of Graphs with Girth at Least Five on a Surface ⋮ On 2-defective DP-colorings of sparse graphs ⋮ Defective DP-colorings of sparse multigraphs ⋮ List strong linear 2-arboricity of sparse graphs ⋮ Defective DP-colorings of sparse simple graphs ⋮ Splitting a planar graph of girth 5 into two forests with trees of small diameter ⋮ 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 ⋮ Planar graphs with girth at least 5 are \((3, 4)\)-colorable ⋮ An \((F_3,F_5)\)-partition of planar graphs with girth at least 5 ⋮ Limits of Near-Coloring of Sparse Graphs
This page was built for publication: List improper colorings of planar graphs with prescribed girth
