On the Vertex-Distinguishing Proper Edge-Colorings of Graphs

Journal of Combinatorial Theory. Series B

Volumn 75, Issue 2, 1999, Pages 288-301

  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 Faculty of Applied Mathematics A G H   (Poland)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0043102771     PISSN: 00958956     EISSN: None     Source Type: Journal    
DOI: 10.1006/jctb.1998.1884     Document Type: Article

References (11)

1. Aigner M., Triesch E. Irregular assignments of trees and forests. SIAM J. Discrete Math. 3:1990;439-449.
2. Aigner M., Triesch E., Tuza Z. Irregular assignments and vertex-distinguishing edge-colorings of graphs. Ann. Discrete Math. 52:1990;1-9.
3. Bondy J. A., Murty U. S. R. Graph Theory with Applications. 1976;McMillan, London.
4. Burris A. C. Vertex-Distinguishing Edge-Colorings. 1993;Memphis State University.
5. Burris A. C., Schelp R. H. Vertex-distinguishing proper edge-colorings. J. Graph Theory. 26:1997;73-83.
6. Černý J., Horňák M., Soták R. Observability of a graph. Math. Slovaca. 46:1996;21-31.
7. Chartrand G., Jacobson M., Lehel J., Oellerman O., Ruiz S., Saba F. Irregular networks. Proceedings of the 250th Anniversary Conference on Graph Theory. 1986.
8. Favaron O., Li H., Schelp R. H. Strong edge coloring of graphs. Discrete Math. 159:1996;103-109.
9. n. Discrete Math. 176:1997;139-148.
10. Horňák M., Soták R. Observability of complete multipartite graphs with equipotent parts. Ars Combin. 41:1995;289-301.
11. Lehel J. Facts and quests on degree irregular assignments. Graph Theory, Combinatorics and Applications. 1991;Wiley, New York. p. 765-781.