An extension of Thomassen's result on choosability
Abstract
Thomassen proved that all planar graphs are 5-choosable. Skrekovski strengthened the result by showing that all K5-minor-free graphs are 5-choosable. Dvor\'ak and Postle pointed out that all planar graphs are DP-5-colorable. In this note, we first improve these results by showing that every K5-minor-free or K3, 3-minor-free graph is DP-5-colorable. In the final section, we further improve these results under the term strictly f-degenerate transversal.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.