Elsevier

Discrete Mathematics

Volume 309, Issue 16, 28 August 2009, Pages 5147-5157
Discrete Mathematics

Neighbor-distinguishing k-tuple edge-colorings of graphs

https://doi.org/10.1016/j.disc.2009.04.003Get rights and content
Under an Elsevier user license
open archive

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
Fractional coloring
Circular coloring

Cited by (0)