Room designs and one-factorizations

DOI10.1007/BF02190160MaRDI QIDQ1155059zbMATH OpenOpenAlexWikidataFDO

Authors J. D. Horton

Publication date 1981

Published in Aequationes Mathematicae (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/136854

zbMATH Keywords

one-factorizationroom square

Mathematics Subject Classification ID

Orthogonal arrays, Latin squares, Room squares (05B15) Other designs, configurations (05B30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites work

• scientific article; zbMATH DE number 3475458 (Why is no real title available?)
• scientific article; zbMATH DE number 3634268 (Why is no real title available?)
• scientific article; zbMATH DE number 3428943 (Why is no real title available?)
• scientific article; zbMATH DE number 3428944 (Why is no real title available?)
• A counterexample to a direct product construction of Room squares
• A recursive construction for Room designs
• An Existence Theorem for Room Squares*
• Combinatorics. Room squares, sum-free sets, Hadamard matrices
• Construction of Room Squares
• On Stanton and Mullin's Construction of Room Squares
• Quintuplication of Room squares
• Some new classes of strong starters
• The existence of Room squares

Cited in

(30)

• Cycles of quadratic Latin squares and antiperfect 1‐factorisations
• Equivalence of Room designs. II
• The construction of Kotzig factorizations
• The existence of Room 5-cubes
• Row‐Hamiltonian Latin squares and Falconer varieties
• On strong Skolem starters
• The spectrum of room cubes
• The existence of subdigraphs with orthogonal factorizations in digraphs
• Discussions on orthogonal factorizations in digraphs
• A multiplication theorem for strong starters
• Orthogonal starters in finite abelian groups
• On strong Skolem starters for \(\mathbb{Z}_{pq} \)
• A note on two orthogonal totally \(C_4\)-free one-factorizations of complete graphs
• A note on strong Skolem starters
• A Fast Algorithm for Finding Strong Starters
• Orthogonal one-factorizations of complete multipartite graphs
• A result on \(r\)-orthogonal factorizations in digraphs
• Orthogonal resolutions in odd balanced tournament designs
• Orbit-disjoint regular \((n, 3, 1)\)-CDPs and their applications to multilength OOCs
• The existence of Room squares
• Randomly orthogonal factorizations with constraints in bipartite networks
• Two orthogonal 4-cycle-free one-factorizations of complete graphs
• On resolvable designs \(S_ 3(3;4,v)\)
• On the structure of uniform one-factorizations from starters in finite fields
• On \((1,C_4)\) one-factorization and two orthogonal \((2,C_4)\) one-factorizations of complete graphs
• Randomly orthogonal factorizations in networks
• The spectrum of Room cubes
• A generalization of orthogonal factorizations in digraphs
• On Steiner tableaus
• A generalization of orthogonal factorizations in graphs

This page was built for publication: Room designs and one-factorizations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1155059)