A \((3,1)^\ast\)-choosable theorem on planar graphs

DOI10.1007/S10878-015-9913-7zbMath1348.05058OpenAlexW899176803MaRDI QIDQ326497

Min Chen, Wei Fan Wang, Andre Raspaud

Publication date: 12 October 2016

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-015-9913-7

zbMATH Keywords

cycleplanar graphsimproper choosability

Mathematics Subject Classification ID

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

Related Items (2)

Sufficient conditions on planar graphs to have a relaxed DP-3-coloring ⋮ Every planar graph without 3-cycles adjacent to 4-cycles and without 6-cycles is (1, 1, 0)-colorable

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• List colourings of planar graphs
• On \((3, 1)^\ast\)-choosability of planar graphs without adjacent short cycles
• 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
• Every planar graph is 5-choosable
• 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
• On $(3,1)^*$-Coloring of Plane Graphs
• Improper Choosability of Planar Graphs without 4-Cycles
• Improper choosability of graphs and maximum average degree
• A note on list improper coloring planar graphs

This page was built for publication: A \((3,1)^\ast\)-choosable theorem on planar graphs