A note on {4}-GDDs of type 2 10

Discrete Mathematics

Volumn 261, Issue 1-3, 2003, Pages 373-376

  Kreher, D L ^a   Ling, A C H ^a   Rees, R S ^a   Lam, C W H ^b  

^a MICHIGAN TECHNOLOGICAL UNIVERSITY   (United States)

^b Dept of Electrical and Computer Engineering   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84867948991     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0012-365X(02)00482-X     Document Type: Article

References (9)

1. A. Assaf, A. Hartman, Resolvable group divisible designs with block size 3, Discrete Math. 77 (1989) 5-20.
2. G. Ge, Resolvable group divisible designs with block size four, Discrete Math., to appear.
3. A. Kotzig, A. Rosa, Nearly Kirkman systems, Proceedings of Fifth S.E. Conference on Combinatorics, Graph Theory and Computing, Boca Raton, 1974, pp. 607-614.
4. D.L. Kreher, D.R. Stinson, Combinatorial Algorithms: Generation, Enumeration and Search, CRC press LTC, Boca Raton, FL, 1998.
5. C.W.H. Lam, Computer construction of block designs, in: Bailey (Ed.), Surveys in Combinatorics, London Mathematical Society Lecture Note Series, Vol. 241, 1997, Cambridge University Press, Cambridge 1997, pp. 51-66.
6. B.D. McKay, NAUTY User's Guide (version 1.5), Technical Report, TR-CS-90-02, Department of Computer Science, Australian National University, 1990.
7. R. Rees, Two new direct-roduct type constructions for resolvable group divisible designs, J. Combin. Designs 1 (1993) 15-26.
8. R. Rees, D.R. Stinson, On resolvable group-divisible designs with block size three, Ars Comb. 23 (1987) 107-120.
9. H. Shen, J. Shen, Further results on the existence of labeled resolvable block designs, J. Shanghai Jiao Tong Univ. E-4 (2) (1999) 52-56.