Neighbor-distinguishing k-tuple edge-colorings of graphs

被引:1
作者
Baril, Jean-Luc [1 ]
Togni, Olivier [1 ]
机构
[1] Univ Bourgogne, CNRS, LE21, UMR 5158, F-21078 Dijon, France
关键词
Graph; k-tuple edge-coloring; Neighbor-distinguishing; Adjacent vertex-distinguishing; Fractional coloring; Circular coloring; CIRCULAR CHROMATIC INDEX;
D O I
10.1016/j.disc.2009.04.003
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
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. (C) 2009 Elsevier B.V. All rights reserved.
引用
收藏
页码:5147 / 5157
页数:11
相关论文
共 16 条
[1]  
[Anonymous], 1995, WILEY INTERSCIENCE S
[2]   Adjacent vertex distinguishing edge-colorings [J].
Balister, P. N. ;
Gyori, E. ;
Lehel, J. ;
Schelp, R. H. .
SIAM JOURNAL ON DISCRETE MATHEMATICS, 2007, 21 (01) :237-250
[3]  
Baril JL, 2006, AUSTRALAS J COMB, V35, P89
[4]  
BARIL JL, 2008, ARS COMBINA IN PRESS
[5]   On the neighbour-distinguishing index of a graph [J].
Edwards, Keith ;
Hornak, Mirko ;
Wozniak, Mariusz .
GRAPHS AND COMBINATORICS, 2006, 22 (03) :341-350
[6]  
GREENHILL C, 2006, ELECT J COMBIN, V13
[7]   General neighbour-distinguishing index of a graph [J].
Gyori, Ervin ;
Hornak, Mirko ;
Palmer, Cory ;
Wozniak, Mariusz .
DISCRETE MATHEMATICS, 2008, 308 (5-6) :827-831
[8]   Δ+300 is a bound on the adjacent vertex distinguishing edge chromatic number [J].
Hatami, H .
JOURNAL OF COMBINATORIAL THEORY SERIES B, 2005, 95 (02) :246-256
[9]  
HORNAK M, 2007, ELECT NOTES DISCRETE, V24, P295
[10]   The circular chromatic index of graphs of high girth [J].
Kaiser, Tomas ;
Kral, Daniel ;
Skrekovski, Riste ;
Zhu, Xuding .
JOURNAL OF COMBINATORIAL THEORY SERIES B, 2007, 97 (01) :1-13