Room designs and one-factorizations
From MaRDI portal
Cites work
- 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
- 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?)
- 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
(33)- The existence of Room 5-cubes
- On resolvable designs \(S_ 3(3;4,v)\)
- Orthogonal resolutions in odd balanced tournament designs
- The spectrum of room cubes
- A multiplication theorem for strong starters
- On Steiner tableaus
- The existence of Room squares
- Randomly orthogonal factorizations with constraints in bipartite networks
- A generalization of orthogonal factorizations in digraphs
- Two orthogonal 4-cycle-free one-factorizations of complete graphs
- Orthogonal starters in finite abelian groups
- The construction of Kotzig factorizations
- Equivalence of Room designs. II
- A note on two orthogonal totally \(C_4\)-free one-factorizations of complete graphs
- On (1,C₄) one-factorization and two orthogonal (2,C₄) one-factorizations of complete graphs
- Discussions on orthogonal factorizations in digraphs
- The existence of subdigraphs with orthogonal factorizations in digraphs
- A note on strong Skolem starters
- A result on r-orthogonal factorizations in digraphs
- Randomly orthogonal factorizations in networks
- Orthogonal one-factorizations of complete multipartite graphs
- On the structure of uniform one-factorizations from starters in finite fields
- A Fast Algorithm for Finding Strong Starters
- Orbit-disjoint regular \((n, 3, 1)\)-CDPs and their applications to multilength OOCs
- On strong Skolem starters for \(\mathbb{Z}_{pq} \)
- On strong Skolem starters
- A generalization of orthogonal factorizations in graphs
- Cycles of quadratic Latin squares and antiperfect 1‐factorisations
- Row‐Hamiltonian Latin squares and Falconer varieties
- Regarding r-orthogonal factorizations in bipartite graphs
- Vertex numbers of simplicial complexes with free abelian fundamental group
- A note on cyclic skew frame starters in \(\mathbb{Z}_{pq}\) and \(\mathbb{Z}_{p^n}\)
- The spectrum of Room cubes
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)
