Room designs and one-factorizations

From MaRDI portal
Publication:1155059

DOI10.1007/BF02190160zbMath0466.05012OpenAlexW1967953504WikidataQ114233871 ScholiaQ114233871MaRDI QIDQ1155059

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




Related Items (30)

A Fast Algorithm for Finding Strong StartersDiscussions on orthogonal factorizations in digraphsThe existence of subdigraphs with orthogonal factorizations in digraphsOn strong Skolem startersThe existence of Room 5-cubesOn resolvable designs \(S_ 3(3;4,v)\)Orthogonal resolutions in odd balanced tournament designsRandomly orthogonal factorizations with constraints in bipartite networksA result on \(r\)-orthogonal factorizations in digraphsRandomly orthogonal factorizations in networksOrthogonal one-factorizations of complete multipartite graphsCycles of quadratic Latin squares and antiperfect 1‐factorisationsRow‐Hamiltonian Latin squares and Falconer varietiesA generalization of orthogonal factorizations in digraphsThe spectrum of room cubesOrbit-disjoint regular \((n, 3, 1)\)-CDPs and their applications to multilength OOCsTwo orthogonal 4-cycle-free one-factorizations of complete graphsA multiplication theorem for strong startersOn the structure of uniform one-factorizations from starters in finite fieldsOn Steiner tableausThe existence of Room squaresA note on two orthogonal totally \(C_4\)-free one-factorizations of complete graphsA note on strong Skolem startersA generalization of orthogonal factorizations in graphsOn strong Skolem starters for ℤpqOrthogonal starters in finite abelian groupsOn \((1,C_4)\) one-factorization and two orthogonal \((2,C_4)\) one-factorizations of complete graphsThe construction of Kotzig factorizationsThe spectrum of Room cubesEquivalence of Room designs. II



Cites Work


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