On Choosability with Separation of Planar Graphs with Forbidden Cycles

DOI10.1002/jgt.21875zbMath1333.05086arXiv1303.2753OpenAlexW1941702003MaRDI QIDQ2800544

Bernard Lidický, Ilkyoo Choi, Derrick Stolee

Publication date: 15 April 2016

Published in: Journal of Graph Theory (Search for Journal in Brave)

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

zbMATH Keywords

\((k,d)\)-list assignment

Mathematics Subject Classification ID

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

Related Items (9)

Choosability with union separation of planar graphs without cycles of length 4 ⋮ \((4,2)\)-choosability of planar graphs with forbidden structures ⋮ A sufficient condition for planar graphs to be (3,1)-choosable ⋮ Choosability with union separation ⋮ List 4-colouring of planar graphs ⋮ On the \((3, 1)\)-choosability of planar graphs without adjacent cycles of length \(5, 6, 7\) ⋮ On choosability with separation of planar graphs without adjacent short cycles ⋮ Choosability with separation of planar graphs without prescribed cycles ⋮ IC-Planar Graphs Are 6-Choosable

Cites Work

• Unnamed Item
• List colourings of planar graphs
• A smaller planar graph without 4-, 5-cycles and intersecting triangles that is not 3-choosable
• Every planar graph is 5-choosable
• 3-list-coloring planar graphs of girth 5
• A not 3-choosable planar graph without 3-cycles
• Colorings of plane graphs: a survey
• Brooks-type theorems for choosability with separation
• Choosability with Separation of Complete Multipartite Graphs and Hypergraphs

This page was built for publication: On Choosability with Separation of Planar Graphs with Forbidden Cycles