Degree-truncated choice number of planar graphs
Authors:
- Yiting JiangYJYiting Jiang
- Huijuan XuHXHuijuan Xu
- Xinbo XuXXXinbo Xu
- Xuding ZhuXZXuding Zhu
- 10 February 2026
- journal article
- Published by Elsevier in Discrete Mathematics
- Vol. 349 (7)
Abstract
No abstract availableAll Related Versions
This publication has 6 references indexed in Scilit:
- Degree-truncated DP-colourability of
K
2
,
4
-minor-free graphsEuropean Journal of Combinatorics, 2025
- Degree-truncated choosability of graphsJournal of Combinatorial Theory, Series B, 2025
- List Colorings of K5‐Minor‐Free Graphs With Special List AssignmentsJournal of Graph Theory, 2011
- On list-coloring outerplanar graphsJournal of Graph Theory, 2008
- Every Planar Graph Is 5-ChoosableJournal of Combinatorial Theory, Series B, 1994
- Rectilinear planar layouts and bipolar orientations of planar graphsDiscrete & Computational Geometry, 1986