There are 526,915,620 nonisomorphic one‐factorizations of K12
- 1 January 1994
- journal article
- Published by Wiley in Journal of Combinatorial Designs
- Vol. 2 (4) , 273-285
- https://doi.org/10.1002/jcd.3180020406
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- On the enumeration of one-factorizations of complete graphs containing prescribed automorphism groupsMathematics of Computation, 1988
- On strong starters in cyclic groupsDiscrete Mathematics, 1985
- One‐factorizations of the complete graph—A surveyJournal of Graph Theory, 1985
- Intersection of perfect 1-factorizations of complete graphsCybernetics and Systems Analysis, 1980
- Every one a Winner or how to Avoid Isomorphism Search when Cataloguing Combinatorial ConfigurationsPublished by Elsevier ,1978
- A recursive construction of asymmetric 1-factorizationsAequationes mathematicae, 1977
- Parallelisms of Complete DesignsPublished by Cambridge University Press (CUP) ,1976
- On the number of 1-factorizations of the complete graphJournal of Combinatorial Theory, Series B, 1976
- Enumeration of latin squares with application to order 8Journal of Combinatorial Theory, 1968
- 8The American Mathematical Monthly, 1906