Packing Circuits into KN

Combinatorics Probability and Computing

Volumn 10, Issue 6, 2001, Pages 463-499

  Balister, Paul ^a  

^a University of Memphis   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0442280206     PISSN: 09635483     EISSN: None     Source Type: Journal    
DOI: 10.1017/s0963548301004771     Document Type: Article

References (12)

1. Aigner, M., Triesch, E. and Tuza, Zs. (1992) Irregular assignments and vertex-distinguishing edge-colorings of graphs. In Vol. 90 of Combinatorics (A. Barlotti et al., eds), Elsevier Science Pub., New York, pp. 1-9.
2. Burris, A. C. and Schelp, R. H. (1997) Vertex-distinguishing proper edge-colorings, J. Graph Theory 26 73-82.
3. Balister, P. N., Bollobás, B. and Schelp, R. H. (2001) Vertex-distinguishing colorings of graphs with Δ(G) = 2. To appear.
4. Alspach, B. (1981) Research problem 3. Discrete Math. 36 333.
5. n - I. J. Combin. Theory Ser. B 81 77-99.
6. Alspach, B. and Marshall, S. (1994) Even cycle decompositions of complete graphs minus a 1-factor. J. Combin. Designs 2 441-458.
7. Adams, P., Bryant, D. E. and Khodkar, A. (1998) 3,5-cycle decompositions. J. Combin. Designs 6 91-110.
8. Doyen, J. and Wilson, R. M. (1973) Embeddings of Steiner triple systems. Discrete Math. 5 229-239.
9. Hwang, F. K. and Lin, S. (1977) Neighbor designs. J. Combin. Theory Ser. A 23 302-313.
10. Mendelsohn, E. and Rosa, A. (1983) Embedding maximal packings of triples. Congr. Numer. 40 235-247.
11. Rosa, A. Alspach's conjecture is true for n ≤ 10. Math. Reports, McMaster University.
12. Heinrich, K., Horak, P. and Rosa, A. (1989) On Alspach's conjecture. Discrete Math. 77 97-121.