Degree-truncated DP-colourability of K 2 , 4 -minor-free graphs
Authors:
- On-Hei Solomon LoOLOn-Hei Solomon Lo
- Cheng WangCWCheng Wang
- Huan ZhouHZHuan Zhou
- Xuding ZhuXZXuding Zhu
- 12 December 2025
- journal article
- Published by Elsevier in European Journal of Combinatorics
- Vol. 133
Abstract
No abstract availableFunding Information
- National Natural Science Foundation of China
This publication has 6 references indexed in Scilit:
- Degree-truncated choosability of graphsJournal of Combinatorial Theory, Series B, 2025
- A note on a Brooks' type theorem for DP‐coloringJournal of Graph Theory, 2018
- 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
- A Characterization of $K_{2,4}$-Minor-Free GraphsSIAM Journal on Discrete Mathematics, 2016
- On list-coloring outerplanar graphsJournal of Graph Theory, 2008