On one-factorizations of complete graphs
From MaRDI portal
Cited in
(17)- A recursive construction of asymmetric 1-factorizations
- Equivalence of Room designs. II
- On the initial transition of graphs of Kirkman schedules by the partial team swap
- On the Enumeration of One-Factorizations of Complete Graphs Containing Prescribed Automorphism Groups
- Steiner quadruple systems - a survey
- One-factorisations of complete graphs arising from ovals in finite planes
- Classification of Steiner quadruple systems of order 16 and rank 14
- On the convergence of the mild random walk algorithm to generate random one-factorizations of complete graphs
- On the number of 1-factorizations of the complete graph
- One-factorisations of complete graphs constructed in Desarguesian planes of certain odd square orders
- On the existence of automorphism free Steiner triple systems
- The existence of Room squares
- Structure of Steiner triple systems \(S(2^m-1,3,2)\) of rank \(2^m-m+2\) over \(\mathbb F_2\)
- Domination-related parameters in middle graphs
- A theorem on the maximum number of disjoint Steiner triple systems
- Some extremal connectivity results for matroids
- Designs for half-diallel experiments with commutative orthogonal block structure
This page was built for publication: On one-factorizations of complete graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5685114)
