5-list-coloring planar graphs with distant precolored vertices
From MaRDI portal
Publication:345086
DOI10.1016/j.jctb.2016.06.006zbMath1350.05019arXiv1209.0366OpenAlexW3105851171MaRDI QIDQ345086
Zdeněk Dvořák, Bojan Mohar, Luke Postle, Bernard Lidický
Publication date: 25 November 2016
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1209.0366
Related Items (6)
Five-list-coloring graphs on surfaces. II: A linear bound for critical graphs in a disk. ⋮ Hyperbolic families and coloring graphs on surfaces ⋮ Flexibility of triangle‐free planar graphs ⋮ Colorings, transversals, and local sparsity ⋮ 5-choosability of graphs with crossings far apart ⋮ On Baire measurable colorings of group actions
Cites Work
- Five-list-coloring graphs on surfaces. II: A linear bound for critical graphs in a disk.
- 5-choosability of graphs with crossings far apart
- List precoloring extension in planar graphs
- List colourings of planar graphs
- Exponentially many 5-list-colorings of planar graphs
- The non-existence of colorings
- Every planar map is four colorable. I: Discharging
- Every planar map is four colorable. II: Reducibility
- You can't paint yourself into a corner
- Every planar graph is 5-choosable
- Color-critical graphs on a fixed surface
- Dirac's map-color theorem for choosability
- Unnamed Item
- Unnamed Item
This page was built for publication: 5-list-coloring planar graphs with distant precolored vertices
