Neighbor-distinguishing k-tuple edge-colorings of graphs

Jean-Luc Baril, Olivier Togni
2009 Discrete Mathematics  
This paper studies proper k-tuple edge-colorings of graphs that distinguish neighboring vertices by their sets of colors. Minimum numbers of colors for such colorings are determined for cycles, complete graphs and complete bipartite graphs. A variation in which the color sets assigned to edges have to form cyclic intervals is also studied and similar results are given.
doi:10.1016/j.disc.2009.04.003 fatcat:lh3vyu2cmfa2fdxouvruwldcl4