| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4649576 | Discrete Mathematics | 2009 | 11 Pages |
Abstract
This paper studies proper kk-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.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Jean-Luc Baril, Olivier Togni,