A note on list improper coloring planar graphs
From MaRDI portal
Publication:5938913
DOI10.1016/S0893-9659(00)00147-6zbMath0978.05029OpenAlexW1967561636MaRDI QIDQ5938913
Ke Min Zhang, Wei Fan Wang, Ko-Wei Lih, Zeng Min Song
Publication date: 7 August 2001
Published in: Applied Mathematics Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0893-9659(00)00147-6
Related Items (31)
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 of graphs of nonnegative characteristic ⋮ Every toroidal graph without adjacent triangles is \((4,1)^{*}\)-choosable ⋮ A non-3-choosable planar graph without cycles of length 4 and 5 ⋮ 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 ⋮ Planar graphs without cycles of length 4 or 5 are \((2, 0, 0)\)-colorable ⋮ Improper choosability of graphs embedded on the surface of genus \(r\) ⋮ 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 ⋮ \((1,0,0)\)-colorability of planar graphs without cycles of length 4, 5 or 9 ⋮ 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 ⋮ Every planar graph without 3-cycles adjacent to 4-cycles and without 6-cycles is (1, 1, 0)-colorable ⋮ Decomposing a planar graph without triangular 4-cycles into a matching and a 3-colorable graph ⋮ A note on list improper coloring of plane graphs ⋮ On \((3, 1)^\ast\)-choosability of planar graphs without adjacent short cycles ⋮ The Alon-Tarsi number of planar graphs without cycles of lengths 4 and \(l\) ⋮ 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 ⋮ Relaxed DP-coloring and another generalization of DP-coloring on planar graphs without 4-cycles and 7-cycles
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A note on the three color problem
- 3-list-coloring planar graphs of girth 5
- A not 3-choosable planar graph without 3-cycles
- List improper colorings of planar graphs with prescribed girth
- List Improper Colourings of Planar Graphs
- Structural properties of plane graphs without adjacent triangles and an application to 3-colorings
- A Grötzsch-Type Theorem for List Colourings with Impropriety One
- 25 pretty graph colouring problems
This page was built for publication: A note on list improper coloring planar graphs
