Balanced edge colorings

Journal of Combinatorial Theory. Series B

Volumn 90, Issue 1, 2004, Pages 3-20

  Balister, P N ^a   Kostochka, A ^a,b   Li, Hao ^c   Schelp, R H ^a  

^a University of Memphis   (United States)

^b SOBOLEV INSTITUTE OF MATHEMATICS   (Russian Federation)

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

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0347129771     PISSN: 00958956     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0095-8956(03)00073-X     Document Type: Article

References (11)

1. M. Aigner, E. Triesch, Zs. Tuza, Irregular assignments and vertex-distinguishing edge-colorings of graphs, in: A. Barlotti et al. (Eds.), Combinatorics, Vol. 90, Elsevier Science Pub., New York, 1992, pp. 1-9.
2. n, Combin. Probab. Comput. 10 (2001) 463-499.
3. P.N. Balister, B. Bollobás, R.H. Schelp, Vertex-distinguishing colorings of graphs with Δ(G) = 2, Discrete Math. 252 (2002) 17-29.
4. C. Bazgan, A. Harkat-Benhamdine, H. Li, M. Woźniak, On the vertex-distinguishing proper edge-colorings of graphs, J. Control Theory B 75 (1999) 288-301.
5. A.C. Burris, Vertex-distinguishing edge-colorings, Ph.D. Dissertation, Memphis State University, August 1993.
6. A.C. Burris, R.H. Schelp, Vertex-distinguishing proper edge-colourings, J. Game Theory 26 (2) (1997) 70-82.
7. J. Čerńy, M. Hořnák, R. Soták, Observability of a graph, Math. Slovaca 46 (1996) 21-31.
8. O. Favaron, Hao Li, R.H. Schelp, Strong edge colorings of graphs, Discrete Math. 159 (1996) 103-109.
9. M. Hořnák, R. Soták, Observability of complete multipartite graphs with equipotent parts, Ars. Combin. 41 (1995) 289-301.
10. n, preprint.
11. V.G. Vizing, Critical graphs with a given chromatic class, Diskret. Analiz. 5 (1965) 9-17 (in Russian).