Improper choosability of planar graphs without 4-cycles

DOI10.1137/120885140MaRDI QIDQ5408607zbMATH OpenOpenAlexFDO

Authors Lingji Xu, Yingqian 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

cycledischargingimproper choosabilityplanar graphreducibility

Mathematics Subject Classification ID

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

Recommendations

• Improper choosability of planar graphs without 6-circuits
• The 4-choosability of plane graphs without 4-cycles
• A note on list improper coloring of plane graphs
• Improper colorability of planar graphs without prescribed short cycles
• Improper colorability of planar graphs with cycles of length neither 4 nor 6

Cited in

(23)

• Planar graphs without 3-cycles adjacent to cycles of length 3 or 5 are \((3, 1)\)-colorable
• Sufficient conditions on planar graphs to have a relaxed DP-3-coloring
• Acyclic improper choosability of subcubic graphs
• Every planar graph without triangles adjacent to cycles of length 3 or 6 is \(( 1 , 1 , 1 )\)-colorable
• Decomposing a planar graph without triangular 4-cycles into a matching and a 3-colorable graph
• (3, 1)-choosability of toroidal graphs with some forbidden short cycles
• Every planar graph without cycles of length 4 or 9 is \((1, 1, 0)\)-colorable
• Improper colorability of planar graphs without prescribed short cycles
• Colorings of plane graphs without long monochromatic facial paths
• (3, 1)^*-choosability of graphs of nonnegative characteristic without intersecting short cycles
• List improper coloring of graphs of nonnegative characteristic
• Improper choosability of planar graphs without 6-circuits
• A \((3,1)^\ast\)-choosable theorem on planar graphs
• Characterization of Cycle Obstruction Sets for Improper Coloring Planar Graphs
• Decomposing a planar graph without cycles of length 5 into a matching and a 3-colorable graph
• On improperly chromatic-choosable graphs
• Improper choosability of graphs and maximum average degree
• Decomposing planar graphs without triangular short cycles into a matching and a 3-colorable graph
• On two problems of defective choosability of graphs
• Planar graphs without 4-cycles and close triangles are \((2,0,0)\)-colorable
• A (3,1)^*-choosability of plane graphs with neither adjacent short cycles nor 7-cycles
• On \((3, 1)^\ast\)-choosability of planar graphs without adjacent short cycles
• Planar graphs without cycles of length 4 or 5 are (2, 0, 0)-colorable

This page was built for publication: Improper choosability of planar graphs without 4-cycles

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5408607)