An extension of Thomassen’s result on choosability

Lingxi Li and Tao Wang

Applied Mathematics and Computation, 2022, vol. 425, issue C

Abstract: Thomassen proved that all planar graphs are 5-choosable. Škrekovski strengthened the result by showing that all K5-minor-free graphs are 5-choosable. Dvořák 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.

Date: 2022
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300322001849
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:425:y:2022:i:c:s0096300322001849

DOI: 10.1016/j.amc.2022.127100

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().