Tighter Bounds on the Degree-Truncated Choice Number of Planar Graphs

Huijuan Xu, Huan Zhou, Jialu Zhu +1

Assume $G$ is a graph and $k$ is a positive integer. Let $f:V(G)\to \mathbb{N}$ be defined as $f(v)=\min \{k,d_G(v)\}$. If $G$ is $f$-choosable, then we say $G$ is degree-truncated…