A note on the vertex-distinguishing proper coloring of graphs with large minimum degree

Discrete Mathematics

Volumn 236, Issue 1-3, 2001, Pages 37-42

  Bazgan, Cristina ^a   Harkat Benhamdine, Amel ^a   Li, Hao ^a   Woźniak, Mariusz ^b  

^a UFR 919 Laboratoire d'Informatique Pour la Mécanique et les Sciences de l'Ingénieur   (France)

^b AGH UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Poland)

Author keywords

Edge coloring; Vertex distinguishing coloring

Indexed keywords

EID: 0035815948     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0012-365X(00)00428-3     Document Type: Article

References (8)

1. C. Bazgan, A. Harkat-Benhamdine, H. Li, M. Woźniak, On the vertex-distinguishing proper edge-colorings of graphs, J. Combin. Theory Ser. B 75 (1999) 288-301.
2. J.A. Bondy, U.S.R. Murty, Graph Theory with Applications, Macmillan, London; Elsevier, New York, 1976.
3. A. C. Burris, Vertex-distinguishing edge-colorings, Ph.D. Dissertation, Memphis State University, 1993.
4. A.C. Burris, R.H. Schelp, Vertex-distinguishing proper edge-colorings, J. Graph Theory 26 (2) (1997) 73-82.
5. J. Černý, M. Horňák, R. Soták, Observability of a graph, Math. Slovaca 46 (1996) 21-31.
6. O. Favaron, H. Li, R.H. Schelp, Strong edge coloring of graphs, Discrete Mathematics 159 (1996) 103-109.
7. M. Horňák, R. Soták, Observability of complete multipartite graphs with equipotent parts, Ars Combinatoria 41 (1995) 289-301.
8. n, Discrete Math. 176 (1997) 139-148.