New results in $t$-tone coloring of graphs

Daniel W. Cranston, Jaehoon Kim, William B. Kinnersley

A $t$-tone $k$-coloring of $G$ assigns to each vertex of $G$ a set of $t$ colors from $\{1,...,k\}$ so that vertices at distance $d$ share fewer than $d$ common colors. The {\it $…