Title of article
Neighbor-distinguishing -tuple edge-colorings of graphs
Author/Authors
Baril، نويسنده , , Jean-Luc and Togni، نويسنده , , Olivier، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2009
Pages
11
From page
5147
To page
5157
Abstract
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.
Keywords
graph , k -tuple edge-coloring , Neighbor-distinguishing , Adjacent vertex-distinguishing , Circular coloring , Fractional coloring
Journal title
Discrete Mathematics
Serial Year
2009
Journal title
Discrete Mathematics
Record number
1599043
Link To Document