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 cyclesA \((3,1)^\ast\)-choosable theorem on planar graphsImproper choosability of graphs of nonnegative characteristicEvery toroidal graph without adjacent triangles is \((4,1)^{*}\)-choosableA non-3-choosable planar graph without cycles of length 4 and 5Improper 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 subgraphsPlanar graphs without cycles of length 4 or 5 are \((2, 0, 0)\)-colorableImproper choosability of graphs embedded on the surface of genus \(r\)Decomposition 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 graph\((1,0,0)\)-colorability of planar graphs without cycles of length 4, 5 or 9Planar 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 graphsEvery planar graph without 3-cycles adjacent to 4-cycles and without 6-cycles is (1, 1, 0)-colorableDecomposing a planar graph without triangular 4-cycles into a matching and a 3-colorable graphA note on list improper coloring of plane graphsOn \((3, 1)^\ast\)-choosability of planar graphs without adjacent short cyclesThe Alon-Tarsi number of planar graphs without cycles of lengths 4 and \(l\)ON (3, 1)*-CHOOSABILITY OF TOROIDAL GRAPHSA \((3,1)^*\)-choosable theorem on toroidal graphs(3, 1)-choosability of toroidal graphs with some forbidden short cyclesRelaxed DP-coloring and another generalization of DP-coloring on planar graphs without 4-cycles and 7-cycles



Cites Work


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