Δ + 300 is a bound on the adjacent vertex distinguishing edge chromatic number

Journal of Combinatorial Theory. Series B

Volumn 95, Issue 2, 2005, Pages 246-256

  Hatami, Hamed ^a  

^a UNIVERSITY OF TORONTO   (Canada)

Author keywords

Adjacent strong edge coloring; Adjacent vertex distinguishing edge coloring; Strong edge coloring; Vertex distinguishing edge coloring

Indexed keywords

EID: 26944473198     PISSN: 00958956     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jctb.2005.04.002     Document Type: Article

References (11)

1. S. Akbari, H. Bidkhori, N. Nosrati, r-strong edge colorings of graphs, Discrete Math., to appear.
2. P.N. Balister, E. Györi, J. Lehel, R.H. Schelp, Adjacent vertex distinguishing edge-colorings, J. Graph Theory, to appear.
3. P.N. Balister O.M. Riordan R.H. Schelp Vertex-distinguishing edge colorings of graphs J. Graph Theory 42 2003 95-109
4. A.C. Burris R.H. Schelp Vertex-distinguishing proper edge-colorings J. Graph Theory 26 2 1997 73-82
5. O. Favaron H. Li R.H. Schelp Strong edge coloring of graphs Discrete Math. 159 1996 103-109
6. M. Ghandehari, H. Hatami, Two upper bounds for the strong edge chromatic number, preprint.
7. n Discrete Math. 176 1997 139-148
8. M. Karoński T. Łuczak A. Thomason Edge weights and vertex colours J. Combin. Theory Ser. B 91 2004 151-157
9. M. Molloy B. Reed Graph Colouring and the Probabilistic Method 2002 Springer Berlin
10. D.B. West Introduction to Graph Theory second ed. 2001 Prentice-Hall Englewood Cliffs, NJ, USA
11. Z. Zhang L. Liu J. Wang Adjacent strong edge coloring of graphs Appl. Math. Lett. 15 2002 623-626