There are 526,915,620 nonisomorphic one‐factorizations of K12
From MaRDI portal
Publication:4764660
DOI10.1002/jcd.3180020406zbMath0817.05049OpenAlexW2054660610WikidataQ114236263 ScholiaQ114236263MaRDI QIDQ4764660
David K. Garnick, Brendan D. McKay, Jeffrey H. Dinitz
Publication date: 4 May 1995
Published in: Journal of Combinatorial Designs (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jcd.3180020406
Related Items
The number of Latin squares of order 11, Edge coloring: a natural model for sports scheduling, Multi-neighborhood simulated annealing for the sports timetabling competition ITC2021, Embedding 1-factorizations of \(K_n\) in \(PG(2,32)\), One-factorisations of complete graphs arising from ovals in finite planes, Enumerating perfect matchings in \(n\)-cubes, A classification of hyperfocused 12-arcs, Switching in one-factorisations of complete graphs, Factorisation of the complete graph into spanning regular factors, There are 3155 nonisomorphic perfect one‐factorizations of K16, Solving mirrored traveling tournament problem benchmark instances with eight teams, On the application of graph colouring techniques in round-robin sports scheduling, One-factorizations of complete graphs with vertex-regular automorphism groups, Block colourings of 6-cycle systems, Recoloring subgraphs of \(K_{2n}\) for sports scheduling, Higher melonic theories, There are 1,132,835,421,602,062,347 nonisomorphic one-factorizations ofK14, Three-class association schemes
Cites Work
