Vertex-distinguishing edge colorings of graphs

Journal of Graph Theory

Volumn 42, Issue 2, 2003, Pages 95-109

  Balister, P N ^a   Riordan, O M ^b   Schelp, R H ^a  

^a University of Memphis   (United States)

^b TRINITY COLLEGE   (United Kingdom)

Author keywords

Chromatic number; Edge coloring; Strong coloring

Indexed keywords

EID: 0037324012     PISSN: 03649024     EISSN: None     Source Type: Journal    
DOI: 10.1002/jgt.10076     Document Type: Article

References (11)

1. 1 M. Aigner, E. Triesch, and Z. Tuzu, Irregular assignments and vertex‐distinguishing edge‐colorings of graphs, Combinatorics 90 ( A. Barlotti et al., eds.). Elsevier Science Pub, New York ( 1992), 1–9.
2. 2 P. N. Balister, Packing circuits into K n, Combin Probab Comput 10 ( 2001), 463–499.
3. 3 P. N. Balister, B. Bollobás, and R. H. Schelp, Vertex‐distinguishing colorings of graphs with Δ (G)=2, Discrete Math 252 (1–3) ( 2002), 17–29.
4. 4 P. N. Balister, A. Kostochka, Hao Li, and R. H. Schelp, Balanced edge colorings, submitted.
5. 5 C. Bazgan, A. Harkat‐Benhamdine, Hao Li, and M. Woźniak, On the vertex‐distinguishing proper edge‐colorings of graphs, J Combin Theory B 75 ( 1999), 288–301.
6. 6 B. Bollobás, Modern graph theory, Graduate Texts in Mathematics, Springer ; p. 152–154.
7. 7 B. Bollobás, A probabilistic proof of an asymptotic formula for the number of labelled regular graphs, European J Combin 1 no. 4 ( 1980), 311–316.
8. 8 A. C. Burris and R. H. Schelp, Vertex‐distinguishing proper edge‐colourings, J Graph Theory 26 (2) ( 1997), 70–82.
9. 9 J. Čerńy, M. Hořnák, and R. Soták, Observability of a Graph, Math Slovaca 46 ( 1996), 21–31.
10. 10 M. Hořnák and R. Soták, Observability of complete multipartite graphs with equipotent parts, Ars Combin 41 ( 1995), 289–301.
11. 11 M. Hořnák and R. Soták, Asymptotic behaviour of the observability of Q n, Discrete Math 176 ( 1997), 139–148.