The t-tone chromatic number of random graphs

Deepak Bal, Patrick Bennett, Andrzej Dudek +1

A proper 2-tone $k$-coloring of a graph is a labeling of the vertices with elements from $\left(\genfrac{}{}{0ex}{}{[k]}{2}\right)$ such that adjacent vertices receive disjoint labels and vertices distance…