On one-factorizations of complete graphs
From MaRDI portal
Publication:5685114
DOI10.1017/S1446788700014178zbMath0267.05120OpenAlexW2118014517WikidataQ114116365 ScholiaQ114116365MaRDI QIDQ5685114
Publication date: 1973
Published in: Journal of the Australian Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s1446788700014178
Related Items
One-factorisations of complete graphs arising from ovals in finite planes ⋮ Classification of Steiner quadruple systems of order 16 and rank 14 ⋮ On the number of 1-factorizations of the complete graph ⋮ Structure of Steiner triple systems \(S(2^m-1,3,2)\) of rank \(2^m-m+2\) over \(\mathbb F_2\) ⋮ A theorem on the maximum number of disjoint Steiner triple systems ⋮ On the existence of automorphism free Steiner triple systems ⋮ The existence of Room squares ⋮ A recursive construction of asymmetric 1-factorizations ⋮ Steiner quadruple systems - a survey ⋮ One-factorisations of complete graphs constructed in Desarguesian planes of certain odd square orders ⋮ Some extremal connectivity results for matroids ⋮ On the Enumeration of One-Factorizations of Complete Graphs Containing Prescribed Automorphism Groups ⋮ Equivalence of Room designs. II ⋮ On the convergence of the mild random walk algorithm to generate random one-factorizations of complete graphs
