Degree-truncated choosability of graphs
Authors:
- Huan ZhouHZHuan Zhou
- Jialu ZhuJZJialu Zhu
- Xuding ZhuXZXuding Zhu
- 18 July 2025
- journal article
- Published by Elsevier in Journal of Combinatorial Theory, Series B
- Vol. 175, 171-186
Abstract
No abstract availableAll Related Versions
Funding Information
- Innovative Research Group Project of the National Natural Science Foundation of China
This publication has 7 references indexed in Scilit:
- Correspondence coloring and its application to list-coloring planar graphs without cycles of lengths 4 to 8Journal of Combinatorial Theory, Series B, 2018
- On DP-coloring of graphs and multigraphsSiberian Mathematical Journal, 2017
- The asymptotic behavior of the correspondence chromatic numberDiscrete Mathematics, 2016
- List-colourings2015
- List Colorings of K5‐Minor‐Free Graphs With Special List AssignmentsJournal of Graph Theory, 2011
- On list-coloring outerplanar graphsJournal of Graph Theory, 2008
- Disjoint complete minors and bipartite minorsEuropean Journal of Combinatorics, 2007