On choosability with separation of planar graphs with lists of different sizes
From MaRDI portal
Publication:2346342
DOI10.1016/j.disc.2015.01.008zbMath1315.05038arXiv1306.5283OpenAlexW1991475475MaRDI QIDQ2346342
Bernard Lidický, Henry A. Kierstead
Publication date: 1 June 2015
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1306.5283
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Related Items (3)
\((4,2)\)-choosability of planar graphs with forbidden structures ⋮ Choosability with union separation ⋮ List 4-colouring of planar graphs
Cites Work
This page was built for publication: On choosability with separation of planar graphs with lists of different sizes