A note on list improper coloring of plane graphs
From MaRDI portal
Publication:1003695
DOI10.1016/J.DAM.2008.06.023zbMath1209.05076OpenAlexW2065461360MaRDI QIDQ1003695
Publication date: 4 March 2009
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2008.06.023
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Related Items (21)
Every planar graph without cycles of length 4 or 9 is \((1, 1, 0)\)-colorable ⋮ \((3, 1)^*\)-choosability of graphs of nonnegative characteristic without intersecting short cycles ⋮ A \((3,1)^\ast\)-choosable theorem on planar graphs ⋮ Improper Choosability and Property B ⋮ Every planar graph without triangles adjacent to cycles of length 3 or 6 is \(( 1 , 1 , 1 )\)-colorable ⋮ A \((2, 1)\)-decomposition of planar graphs without intersecting 3-cycles and adjacent \(4^-\)-cycles ⋮ Planar graphs without 3-cycles adjacent to cycles of length 3 or 5 are \((3, 1)\)-colorable ⋮ Decompositions of graphs of nonnegative characteristic with some forbidden subgraphs ⋮ Decomposition of toroidal graphs without some subgraphs ⋮ Decomposition of planar graphs with forbidden configurations ⋮ Improper colorability of planar graphs without prescribed short cycles ⋮ 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 ⋮ Planar graphs with cycles of length neither 4 nor 7 are \((3,0,0)\)-colorable ⋮ Sufficient conditions on planar graphs to have a relaxed DP-3-coloring ⋮ Acyclic improper choosability of subcubic graphs ⋮ Decomposing a planar graph without triangular 4-cycles into a matching and a 3-colorable graph ⋮ On \((3, 1)^\ast\)-choosability of planar graphs without adjacent short cycles ⋮ ON (3, 1)*-CHOOSABILITY OF TOROIDAL GRAPHS ⋮ A \((3,1)^*\)-choosable theorem on toroidal graphs ⋮ (3, 1)-choosability of toroidal graphs with some forbidden short cycles
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Every toroidal graph without adjacent triangles is \((4,1)^{*}\)-choosable
- List improper colorings of planar graphs with prescribed girth
- List Improper Colourings of Planar Graphs
- A Grötzsch-Type Theorem for List Colourings with Impropriety One
- A note on list improper coloring planar graphs
This page was built for publication: A note on list improper coloring of plane graphs
