List Colorings of K5-Minor-Free Graphs With Special List Assignments
From MaRDI portal
Publication:2911050
DOI10.1002/jgt.20628zbMath1248.05062arXiv1105.2532OpenAlexW1925248770MaRDI QIDQ2911050
Zsolt Tuza, Anja Pruchnewski, Daniel W. Cranston, Margit Voigt
Publication date: 12 September 2012
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1105.2532
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Graph minors (05C83)
Related Items
Cites Work
- List colourings of planar graphs
- Every planar graph is 5-choosable
- The colour theorems of Brooks and Gallai extended
- Choosability of \(K_5\)-minor-free graphs
- A note on planar 5-list colouring: Non-extendability at distance 4
- On list-coloring outerplanar graphs
- Graph colorings with local constraints -- a survey