List precoloring extension in planar graphs
From MaRDI portal
Publication:536235
DOI10.1016/j.disc.2011.03.007zbMath1223.05062arXiv1006.5596OpenAlexW2053974194MaRDI QIDQ536235
Joan P. Hutchinson, Michelle A. Lastrina, Maria A. Axenovich
Publication date: 16 May 2011
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1006.5596
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Related Items
Extending precolorings to distinguish group actions ⋮ 5-list-coloring planar graphs with distant precolored vertices ⋮ Flexibility of planar graphs -- sharpening the tools to get lists of size four
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- List colourings of planar graphs
- Exponentially many 5-list-colorings of planar graphs
- You can't paint yourself into a corner
- Every planar graph is 5-choosable
- The colour theorems of Brooks and Gallai extended
- Color-critical graphs on a fixed surface
- A note on planar 5-list colouring: Non-extendability at distance 4
- Dirac's map-color theorem for choosability