A tripling construction for mutually orthogonal symmetric hamiltonian double Latin squares

DOI10.1002/jcd.21638zbMath1409.05042OpenAlexW2899009231MaRDI QIDQ4629521

Justin Z. Schroeder

Publication date: 27 March 2019

Published in: Journal of Combinatorial Designs (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jcd.21638

zbMATH Keywords

Latin squarecomplete graphgraph decompositionHamilton cycle

Mathematics Subject Classification ID

Orthogonal arrays, Latin squares, Room squares (05B15) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Eulerian and Hamiltonian graphs (05C45)

Cites Work

• Unnamed Item
• Unnamed Item
• A lower bound for the number of triangular embeddings of some complete graphs and complete regular tripartite graphs
• A lower bound for the number of orientable triangular embeddings of some complete graphs
• Perfect factorisations of bipartite graphs and Latin squares without proper subrectangles
• Hamiltonian double Latin squares
• New families of atomic Latin squares and perfect 1-factorisations.
• Symmetric Hamilton cycle decompositions of the complete graph
• Orientable Hamilton Cycle Embeddings of Complete Tripartite Graphs I: Latin Square Constructions

This page was built for publication: A tripling construction for mutually orthogonal symmetric hamiltonian double Latin squares