General neighbour-distinguishing index of a graph

Discrete Mathematics

Volumn 308, Issue 5-6, 2008, Pages 827-831

  Gyori, Ervin ^a   Horňák, Mirko ^b   Palmer, Cory ^c   Woźniak, Mariusz ^d  

^a INSTITUTE OF EXPERIMENTAL MEDICINE   (Hungary)

^b P J AFÁRIK UNIVERSITY   (Slovakia)

^c CENTRAL EUROPEAN UNIVERSITY   (Hungary)

^d AGH UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Poland)

Author keywords

Colour set; Edge colouring; General neighbour distinguishing index

Indexed keywords

COMPUTATIONAL GEOMETRY; FINITE DIFFERENCE METHOD; MATHEMATICAL MORPHOLOGY; NUMERICAL METHODS; PROBLEM SOLVING;

COLOUR SETS; EDGE COLOURING; GENERAL NEIGHBOUR-DISTINGUISHING INDEX;

GRAPH THEORY;

EID: 38049160572     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.disc.2007.07.046     Document Type: Article

References (10)

1. P.N. Balister, E. Gyo{combining double acute accent}ri, J. Lehel, R.H. Schelp, Adjacent vertex distinguishing edge-colorings, preprint, 〈http://www.msci.memphis.edu/preprint/avdec.pdf〉.
2. Edwards K., Horňák M., and Woźniak M. On the neighbour-distinguishing index of a graph. Graphs Combin. 22 (2006) 341-350
3. Harary F., and Plantholt M. The point-distinguishing chromatic index. In: Harary F., and Maybee J.S. (Eds). Graphs and Applications (1985), Wiley-Interscience, New York 147-162
4. Hatami H. Δ + 300 is a bound on the adjacent vertex distinguishing edge chromatic number. J. Combin. Theory Ser. B 95 (2005) 246-256
5. n, n. Ars Combin. 42 (1996) 233-242
6. n, n. Discuss. Math. Graph Theory 17 (1997) 243-251
7. Horňák M., and Zagaglia Salvi N. On the point-distinguishing chromatic index of complete bipartite graphs. Ars Combin. 80 (2006) 75-85
8. n, n. Ars Combin. 25B (1988) 93-104
9. n, n. Ars Combin. 29B (1990) 235-244
10. Zhang Z., Liu L., and Wang J. Adjacent strong edge coloring of graph. Appl. Math. Lett. 15 (2002) 623-626