A sufficient condition for planar graphs to be (3,1)-choosable

DOI10.1007/s10878-017-0124-2zbMath1378.05031OpenAlexW2597212755MaRDI QIDQ1679498

Min Chen, Yingying Fan, Yi Qiao Wang, Wei Fan Wang

Publication date: 9 November 2017

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

Full work available at URL: https://doi.org/10.1007/s10878-017-0124-2

zbMATH Keywords

cyclesplanar graphslist coloringchoosability with separation

Mathematics Subject Classification ID

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

Related Items (4)

Choosability with union separation of planar graphs without cycles of length 4 ⋮ On \(L (p, q)\)-labelling of planar graphs without cycles of length four ⋮ 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

Cites Work

• Unnamed Item
• Unnamed Item
• List colourings of planar graphs
• On choosability with separation of planar graphs without adjacent short cycles
• Every planar graph is 5-choosable
• A not 3-choosable planar graph without 3-cycles
• On Choosability with Separation of Planar Graphs with Forbidden Cycles
• Brooks-type theorems for choosability with separation
• Choosability with Separation of Complete Multipartite Graphs and Hypergraphs

This page was built for publication: A sufficient condition for planar graphs to be (3,1)-choosable