Generalized latin rectangles. II: Embedding
From MaRDI portal
Publication:1160182
DOI10.1016/0012-365X(80)90136-3zbMath0476.05018OpenAlexW1974651693MaRDI QIDQ1160182
Anthony J. W. Hilton, Lars Døvling Andersen
Publication date: 1980
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0012-365x(80)90136-3
Related Items (22)
Hamiltonian decompositions of complete regular s-partite graphs ⋮ Embedding factorizations for 3-uniform hypergraphs II: \(r\)-factorizations into \(s\)-factorizations ⋮ Generalized Latin squares. II ⋮ Semi-Latin squares ⋮ Embedding an edge-colored \(K(a^{(p)};\lambda,\mu)\) into a Hamiltonian decomposition of \(K(a^{(p+r)};\lambda,\mu)\) ⋮ A result on generalized Latin rectangles ⋮ Time-tables, polyhedra and the greedy algorithm ⋮ Centrally symmetric and magic rectangles ⋮ Amalgamated Factorizations of Complete Graphs ⋮ On the number of edge-disjoint one factors and the existence of \(k\)-factors in complete multipartite graphs ⋮ Amalgamations of factorizations of complete graphs ⋮ Character groups of dihedral and generalized quaternion groups ⋮ Amalgamations of connected \(k\)-factorizations. ⋮ Hamiltonian double Latin squares ⋮ The embedding of partial triple systems when 4 divides \(\lambda\) ⋮ Outline symmetric Latin squares ⋮ Detachments of Amalgamated 3‐Uniform Hypergraphs Factorization Consequences ⋮ Multi-Latin squares ⋮ Generalized Latin squares. I ⋮ Fractional latin squares, simplex algebras, and generalized quotients ⋮ Hamiltonian decompositions of complete graphs ⋮ On the intricacy of combinatorial construction problems
Cites Work
This page was built for publication: Generalized latin rectangles. II: Embedding