Girth and $\lambda$-choosability of graphs

Yangyan Gu, Xuding Zhu

Assume $k$ is a positive integer, $\lambda =\{k_1,k_2,...,k_q\}$ is a partition of $k$ and $G$ is a graph. A $\lambda$-assignment of $G$ is a $k$-assignment $L$ of $G$ such that…