An extension of Thomassen's result on choosability

DOI10.1016/j.amc.2022.127100OpenAlexW4220991083MaRDI QIDQ2139819

Tao Wang, Lingxi Li

Publication date: 19 May 2022

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2111.15220

Mathematics Subject Classification ID

Graph theory (05Cxx)

Related Items (3)

Planar graphs without normally adjacent short cycles ⋮ Variable degeneracy on toroidal graphs ⋮ Cover and variable degeneracy

Cites Work

• Correspondence coloring and its application to list-coloring planar graphs without cycles of lengths 4 to 8
• Another proof of the 5-choosability of \(K_5\)-minor-free graphs
• Every planar graph is 5-choosable
• Choosability of \(K_5\)-minor-free graphs
• Decomposing a planar graph into an independent set and a 3-degenerate graph
• Decomposing a planar graph into degenerate graphs
• Cover and variable degeneracy
• A generalization of some results on list coloring and DP-coloring
• On DP-coloring of graphs and multigraphs
• Über eine Eigenschaft der ebenen Komplexe
• Thomassen's Choosability Argument Revisited

This page was built for publication: An extension of Thomassen's result on choosability