The list r-hued coloring of trees and unicyclic graphs

Yu Miao, Fengxia Liu

Let $r$ be a positive integer and $G$ be a graph. The list $r$-hued chromatic number of $G$, denoted by $\ddot{I}{‡}_{L,r}(G)$, is the smallest integer $k$, such that for each $k$-list $L$…