Brooks-type theorem for $r$-hued coloring of graphs

Stanislav Jendroľ, Alfréd Onderko

An $r$-hued coloring of a simple graph $G$ is a proper coloring of its vertices such that every vertex $v$ is adjacent to at least $\min \{r,°(v)\}$ differently colored vertices. T…