An extension of Thomassen's result on choosability
Combinatorics
2022-03-31 v2
Abstract
Thomassen proved that all planar graphs are -choosable. \v{S}krekovski strengthened the result by showing that all -minor-free graphs are -choosable. Dvo\v{r}\'{a}k and Postle pointed out that all planar graphs are DP--colorable. In this note, we first improve these results by showing that every -minor-free or -minor-free graph is DP--colorable. In the final section, we further improve these results under the term strictly -degenerate transversal.
Keywords
Cite
@article{arxiv.2111.15220,
title = {An extension of Thomassen's result on choosability},
author = {Lingxi Li and Tao Wang},
journal= {arXiv preprint arXiv:2111.15220},
year = {2022}
}
Comments
7 pages; 1 figure