Improper Choosability of Planar Graphs without 4-Cycles

DOI10.1137/120885140zbMath1291.05077OpenAlexW2031223899MaRDI QIDQ5408607

Lingji Xu, Ying Qian Wang

Publication date: 10 April 2014

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/120885140

zbMATH Keywords

reducibilitycycleplanar graphdischargingimproper choosability

Mathematics Subject Classification ID

Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)

Related Items (15)

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 ⋮ Colorings of plane graphs without long monochromatic facial paths ⋮ Every planar graph without triangles adjacent to cycles of length 3 or 6 is \(( 1 , 1 , 1 )\)-colorable ⋮ Planar graphs without 3-cycles adjacent to cycles of length 3 or 5 are \((3, 1)\)-colorable ⋮ Planar graphs without cycles of length 4 or 5 are \((2, 0, 0)\)-colorable ⋮ Planar graphs without 5-cycles and intersecting triangles are \((1, 1, 0)\)-colorable ⋮ Improper colorability of planar graphs without prescribed short cycles ⋮ Decomposing a planar graph without cycles of length 5 into a matching and a 3-colorable graph ⋮ 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 ⋮ Planar graphs without 4-cycles and close triangles are \((2,0,0)\)-colorable ⋮ (3, 1)-choosability of toroidal graphs with some forbidden short cycles

This page was built for publication: Improper Choosability of Planar Graphs without 4-Cycles