On t-relaxed coloring of complete multi-partite graphs

Jun Lan, Wensong Lin

Let $G$ be a graph and $t$ a nonnegative integer. Suppose $f$ is a mapping from the vertex set of $G$ to $\{1,2,\dots ,k\}$. If, for any vertex $u$ of $G$, the number of neighbors…