Every 3-connected non-complete planar graph is degree-truncated DP-16-colourable, and Richter's degree-truncated 6-choosability question is answered negatively even with lists of size 7.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Degree-truncated choosability of graphs
Every 3-connected non-complete planar graph is degree-truncated DP-16-colourable, and Richter's degree-truncated 6-choosability question is answered negatively even with lists of size 7.