On the neighbour-distinguishing index of a graph

Graphs and Combinatorics

Volumn 22, Issue 3, 2006, Pages 341-350

  Edwards, Keith ^a   Horňák, Mirko ^b   Woźniak, Mariusz ^c  

^a UNIVERSITY OF DUNDEE   (United Kingdom)

^b P J AFÁRIK UNIVERSITY   (Slovakia)

^c AGH UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Poland)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 33751530416     PISSN: 09110119     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00373-006-0671-2     Document Type: Article

References (15)

1. Balister, P. N., Bollobás, B., Schelp, R. H.: Vertex distinguishing colorings of graphs with Δ(G) = 2, Discrete Math. 252, 17-29 (2002)
2. Balister, P.N., Gyori, E., Lehel, J. Schelp, R.H.: Adjacent vertex distinguishing edge-colorings, preprint (2002)
3. Balister, P. N., Kostochka, A., Li, H., Schelp, R. H.: Balanced edge colorings, J. Combin. Theory Ser. B 90, 3-20 (2004)
4. Balister, P. N., Riordan, O.M., Schelp, R. H.: Vertex Distinguishing edge colorings of graphs. J. Graph Theory 42, 95-109 (2003)
5. Bazgan, C., Harkat-Benhamdine, A., Li, H., Woźniak, M.: On the vertex-distinguishing proper edge-colorings of graphs, J. Combin. Theory Ser. B 75, 288-301 (1999)
6. Bazgan, C., Harkat-Benhamdine, A., Li, H., Woźniak, M.: A note on the vertex-distinguishing proper colorings of graphs with large minimum degree. Discrete Math. 236, 37-42 (2001)
7. Burris, A. C.: Vertex-distinguishing edge-colorings, Ph.D. Dissertation, Memphis State University, 1993
8. Burris A. C. and Schelp, R. H.: Vertex-distinguishing proper edge-colorings, J. Graph Theory 26(2), 73-82 (1997)
9. Černý, J., Horňák M., Soták, R.: Observability of a graph, Math. Slovaca 46, 21-31 (1996)
10. Favaron, O. Li, H., Schelp, R.H.: Strong edge colouring of graphs, Discrete Math. 159, 103-109 (1996)
11. Hatami, H., Δ + 300 is a bound on the adjacent vertex distinguishing edge chromatic number, J. Combin. Theory Ser. B 95, 246-256 (2005)
12. Horňák, M., Soták, R.: Observability of complete multipartite graphs with equipotent parts, Ars Combin. 41, 289-301 (1995)
13. n Discrete Math. 176, 139-148 (1997)
14. McDiarmid, C. J. H., Sánchez-Arroyo, A.: Total colouring regular bipartite graphs is NP-hard, Discrete Math. 124, 155-162 (1994)
15. Zhang, Z., Liu, L., Wang, J.: Adjacent strong edge coloring of graphs, Appl. Math. Lett. 15, 623-626 (2002)