On \((3, 1)^\ast\)-choosability of planar graphs without adjacent short cycles

DOI10.1016/j.dam.2013.09.009zbMath1300.05073arXiv1302.2599OpenAlexW2068363505MaRDI QIDQ741735

Min Chen, Andre Raspaud

Publication date: 12 September 2014

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1302.2599

zbMATH Keywords

cycleplanar graphsimproper 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) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items

\((3, 1)^*\)-choosability of graphs of nonnegative characteristic without intersecting short cycles ⋮ A \((3,1)^\ast\)-choosable theorem on planar graphs ⋮ Sufficient conditions on planar graphs to have a relaxed DP-3-coloring ⋮ Acyclic improper choosability of subcubic graphs ⋮ (3, 1)-choosability of toroidal graphs with some forbidden short cycles

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A \((3,1)^*\)-choosable theorem on toroidal graphs
• Every toroidal graph without adjacent triangles is \((4,1)^{*}\)-choosable
• Planar graphs are 1-relaxed, 4-choosable
• A note on list improper coloring of plane graphs
• List improper colorings of planar graphs with prescribed girth
• Defective colorings of graphs in surfaces: Partitions into subgraphs of bounded valency
• List Improper Colourings of Planar Graphs
• A Grötzsch-Type Theorem for List Colourings with Impropriety One
• A note on list improper coloring planar graphs

This page was built for publication: On \((3, 1)^\ast\)-choosability of planar graphs without adjacent short cycles