An extension of Thomassen's result on choosability
Lingxi Li, Tao Wang

TL;DR
This paper extends known results on the choosability of minor-free graphs by proving they are DP-5-colorable and introduces improvements under the concept of strictly f-degenerate transversals.
Contribution
It proves that K5-minor-free and K3,3-minor-free graphs are DP-5-colorable, extending Thomassen's and Skrekovski's results, and further refines these results using strictly f-degenerate transversals.
Findings
K5-minor-free graphs are DP-5-colorable
K3,3-minor-free graphs are DP-5-colorable
Enhanced results via strictly f-degenerate transversal
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
