On choosability with separation of planar graphs without adjacent short cycles

DOI10.1007/S40840-016-0409-0MaRDI QIDQ723623zbMATH OpenOpenAlexFDO

Authors Min Chen, Ko-Wei Lih, Weifan Wang

Publication date 24 July 2018

Published in Bulletin of the Malaysian Mathematical Sciences Society. Second Series (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s40840-016-0409-0

zbMATH Keywords

list coloringcyclesplanar graphschoosability with separation

Mathematics Subject Classification ID

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

Recommendations

• 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 separation of planar graphs without prescribed cycles
• A sufficient condition for planar graphs to be (3,1)-choosable
• On choosability with separation of planar graphs with lists of different sizes

Cites work

• scientific article; zbMATH DE number 890665 (Why is no real title available?)
• A not 3-choosable planar graph without 3-cycles
• A note on choosability with separation for planar graphs.
• Brooks-type theorems for choosability with separation
• Choosability with separation of complete multipartite graphs and hypergraphs
• Every planar graph is 5-choosable
• List colourings of planar graphs
• On choosability with separation of planar graphs with forbidden cycles

Cited in

(14)

• Choosability with union separation of triangle-free planar graphs
• On \((3, r)\)-choosability of some planar graphs
• On \((3, 1)^\ast\)-choosability of planar graphs without adjacent short cycles
• scientific article; zbMATH DE number 4135967 (Why is no real title available?)
• A \((3,1)^\ast\)-choosable theorem on planar graphs
• Choosability with union separation of planar graphs without cycles of length 4
• A note on adaptable choosability and choosability with separation of planar graphs
• Choosability with separation of planar graphs without prescribed cycles
• On the \((3, 1)\)-choosability of planar graphs without adjacent cycles of length \(5, 6, 7\)
• A sufficient condition for planar graphs to be (3,1)-choosable
• A note on choosability with separation for planar graphs.
• On choosability with separation of planar graphs with forbidden cycles
• On \(( 2 , r )\)-choosability of planar graphs without short cycles
• On choosability with separation of planar graphs with lists of different sizes

This page was built for publication: On choosability with separation of planar graphs without adjacent short cycles

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