A note on list improper coloring of plane graphs

From MaRDI portal
Publication:1003695

DOI10.1016/J.DAM.2008.06.023zbMath1209.05076OpenAlexW2065461360MaRDI QIDQ1003695

Wei Dong, Bao-Gang Xu

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




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 cyclesA \((3,1)^\ast\)-choosable theorem on planar graphsImproper Choosability and Property BEvery planar graph without triangles adjacent to cycles of length 3 or 6 is \(( 1 , 1 , 1 )\)-colorableA \((2, 1)\)-decomposition of planar graphs without intersecting 3-cycles and adjacent \(4^-\)-cyclesPlanar graphs without 3-cycles adjacent to cycles of length 3 or 5 are \((3, 1)\)-colorableDecompositions of graphs of nonnegative characteristic with some forbidden subgraphsDecomposition of toroidal graphs without some subgraphsDecomposition of planar graphs with forbidden configurationsImproper colorability of planar graphs without prescribed short cyclesPlanar graphs with cycles of length neither 4 nor 6 are \((2,0,0)\)-colorableDecomposing a planar graph without cycles of length 5 into a matching and a 3-colorable graphPlanar graphs with cycles of length neither 4 nor 7 are \((3,0,0)\)-colorableSufficient conditions on planar graphs to have a relaxed DP-3-coloringAcyclic improper choosability of subcubic graphsDecomposing a planar graph without triangular 4-cycles into a matching and a 3-colorable graphOn \((3, 1)^\ast\)-choosability of planar graphs without adjacent short cyclesON (3, 1)*-CHOOSABILITY OF TOROIDAL GRAPHSA \((3,1)^*\)-choosable theorem on toroidal graphs(3, 1)-choosability of toroidal graphs with some forbidden short cycles




Cites Work




This page was built for publication: A note on list improper coloring of plane graphs