Choosability with separation of planar graphs without prescribed cycles

DOI10.1016/J.AMC.2019.124756MaRDI QIDQ2284787zbMATH OpenOpenAlexFDO

Authors Min Chen, Yingying Fan, Wai Chee Shiu, André Raspaud, Weifan Wang

Publication date 15 January 2020

Published in Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.amc.2019.124756

zbMATH Keywords

adjacent cycleschoosability with separationlist coloringplanar graphs

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

• On choosability with separation of planar graphs without adjacent short cycles
• On choosability with separation of planar graphs with forbidden cycles
• On the \((3, 1)\)-choosability of planar graphs without adjacent cycles of length \(5, 6, 7\)
• Choosability with union separation of planar graphs without cycles of length 4
• A sufficient condition for planar graphs to be (3,1)-choosable

Cites work

• A not 3-choosable planar graph without 3-cycles
• A note on choosability with separation for planar graphs.
• A sufficient condition for planar graphs to be (3,1)-choosable
• Brooks-type theorems for choosability with separation
• Choosability with separation of complete multipartite graphs and hypergraphs
• Every planar graph is 5-choosable
• Graph theory with applications
• List colourings of planar graphs
• On choosability with separation of planar graphs with forbidden cycles
• On choosability with separation of planar graphs without adjacent short cycles

Cited in

(9)

• A sufficient condition for planar graphs to be (3,1)-choosable
• Choosability with union separation
• On the \((3, 1)\)-choosability of planar graphs without adjacent cycles of length \(5, 6, 7\)
• On choosability with separation of planar graphs with lists of different sizes
• Choosability with union separation of planar graphs without cycles of length 4
• On choosability with separation of planar graphs with forbidden cycles
• On list coloring with separation of the complete graph and set system intersections
• Choosability with separation of cycles and outerplanar graphs
• On choosability with separation of planar graphs without adjacent short cycles

This page was built for publication: Choosability with separation of planar graphs without prescribed cycles

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