Abstract
Thomassen proved that all planar graphs are -choosable. Škrekovski strengthened the result by showing that all -minor-free graphs are -choosable. Dvořá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.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.