1 paper
Patrick Bennett, Jade Nichols
A t-tone coloring of a graph G assigns to each vertex a set of t colors such that any pair of vertices u,v with distance d can share at most d−1 colors. In this note,…