Atomic latin squares of order eleven

Journal of Combinatorial Designs

Volumn 12, Issue 1, 2004, Pages 12-34

  Maenhaut, Barbara M ^a,c,d   Wanless, Ian M ^b  

^a UNIVERSITY OF QUEENSLAND   (Australia)

^b AUSTRALIAN NATIONAL UNIVERSITY   (Australia)

^c OPEN UNIVERSITY   (United Kingdom)

^d CHRIST CHURCH   (United Kingdom)

Author keywords

Diagonallycyclic Latin squares; Latin squares; Mutually orthogonal Latin squares; Orthogonal arrays; Perfect 1 factorizations; Self orthogonal Latin squares; Tactical representation

Indexed keywords

EID: 0345742420     PISSN: 10638539     EISSN: 15206610     Source Type: Journal    
DOI: 10.1002/jcd.10064     Document Type: Article

References (21)

1. D. Bryant, B. M. Maenhaut, and I. M. Wanless, A family of perfect factorizations of complete bipartite graphs, J Combin Theory Ser A 98 (2002), 328-342.
2. C. J. Colbourn and J. H. Dinitz (Editors), The CRC handbook of combinatorial designs, CRC Press, Boca Raton, FL, 1996.
3. J. Dénes and A. D. Keedwell, Latin squares: New developments in the theory and applications, Annals Discrete Math, vol 46, North-Holland, Amsterdam, 1991.
4. A. B. Evans, Orthomorphism graphs of groups, Lect Notes in Math 1535, Springer, 1992.
5. A. B. Evans, Maximal sets of mutually orthogonal Latin squares II, Eur J Combin 13 (1992), 345-350.
6. M. F. Franklin, Cyclic generation of orthogonal Latin squares, Ars Combin 17 (1984), 129-139.
7. M. F. Franklin, Cyclic generation of self-orthogonal Latin squares, Utilitas Math 25 (1984), 135-146.
8. P. J. Laufer, On strongly Hamiltonian complete bipartite graphs, Ars Combin 9 (1980), 43-46.
9. J. Q. Longyear, Some isomorphisms between pairs of Latin squares, J Combin Theory Ser B 21 (1976), 91-95.
10. B. D. McKay, nauty User's Guide (Version 1.5), Australian National University, Computer Science Technical Report TR-CS-90-02.
11. B. D. McKay, Isomorph-free exhaustive generation, J Algorithms 26 (1998), 306-324.
12. P. J. Owens and D. A. Preece, Some new non-cyclic Latin squares that have cyclic and Youden properties, Ars Combin 44 (1996), 137-148.
13. P. J. Owens and D. A. Preece, Aspects of complete sets of 9 times; 9 pairwise orthogonal Latin squares, Discrete Math 167/168 (1997), 519-525.
14. E. T. Parker, Computer investigation of orthogonal Latin squares of order ten, Proc Sympos Appl Math 15 (1963), 73-81.
15. E. T. Parker, A collapsed image of a completion of a "turn- square", J Combin Theory Ser A 24 (1978), 128-129.
16. L. Petrenyuk and A. Petrenyuk, Intersection of perfect one-factorizations of complete graphs, Cybernetics 16 (1980), 6-9.
17. E. Seah, Perfect one-factorizations of the complete graph-A survey, Bull Inst Combin Appl 1 (1991), 59-70.
18. M. K. Siu, Which Latin squares are Cayley tables?, Amer Math Monthly 98 (1991), 625-627.
19. W. D. Wallis, One-factorizations, Math Appl, Vol 390, Kluwer Academic, Dordrecht, 1997.
20. I. M. Wanless, Perfect factorizations of bipartite graphs and Latin squares without proper subrectangles, Electron J Combin 6 (1999), R9, 16 pp.
21. I. M. Wanless, Diagonally cyclic Latin squares, (in press).