首页|An extension of Thomassen's result on choosability
An extension of Thomassen's result on choosability
扫码查看
点击上方二维码区域，可以放大扫码查看
原文链接
NSTL
Elsevier
Thomassen proved that all planar graphs are 5-choosable. Skrekovski strengthened the result by showing that all K 5-minor-free graphs are 5-choosable. Dvorak and Postle pointed out that all planar graphs are DP-5-colorable. In this note, we first improve these results by showing that every K 5-minor-free or K-3,K- 3-minor-free graph is DP-5-colorable. In the final section, we further improve these results under the term strictly f-degenerate transversal. (c) 2022 Elsevier Inc. All rights reserved.
NSTL
Elsevier
