2-tone colorings in graphs products
Jennifer A. Loe, Danielle Middelbrooks, Ashley Morris, Kirsti Wash · Discussiones Mathematicae Graph Theory · 2014
A variation of graph coloring known as a t-tone k-coloring assigns a set of t colors to each vertex of a graph from the set {1, . . . , k}, where the sets of colors assigned to any two vertices distance d apart share fewer than d colors in common. The minimum integer k such that a graph G has a ttone k-coloring is known as the t-tone chromatic number. We study the 2-tone chromatic number in three different graph products. In particular,