On the number of 1-factorizations of the complete graph
- 1 June 1976
- journal article
- Published by Elsevier in Journal of Combinatorial Theory, Series B
- Vol. 20 (3) , 265-282
- https://doi.org/10.1016/0095-8956(76)90017-4
Abstract
No abstract availableThis publication has 9 references indexed in Scilit:
- Colouring the Edges of a Multigraph so that Each Vertex has at Most j , or at Least j , Edges of Each Colour on itJournal of the London Mathematical Society, 1975
- On the existence of automorphism free Steiner triple systemsJournal of Algebra, 1975
- Nonisomorphic Steiner triple systemsMathematische Zeitschrift, 1974
- On embedding incomplete symmetric latin squaresJournal of Combinatorial Theory, Series A, 1974
- On one-factorizations of complete graphsJournal of the Australian Mathematical Society, 1973
- Embeddings of Steiner triple systemsDiscrete Mathematics, 1973
- Finite topologies and Hamiltonian pathsJournal of Combinatorial Theory, Series B, 1973
- The completion of finite incomplete Steiner triple systems with applications to loop theoryJournal of Combinatorial Theory, Series A, 1971
- 8The American Mathematical Monthly, 1906