Adjacent vertex distinquishing edge colorings of the direct product of a regular graph by a path or cycle
Laura Frigerio, Federico G. Lastaria, Norma Zagaglia Salvi · Discussiones Mathematicae Graph Theory · 2011
In this paper we investigate the minimum number of colors required for a proper edge coloring of a finite, undirected, regular graph G in which no two adjacent vertices are incident to edges colored with the same set of colors. In particular, we study this parameter in relation to the direct product of G by a path or a cycle.