There are 526,915,620 nonisomorphic one‐factorizations of K12
From MaRDI portal
Publication:4764660
DOI10.1002/JCD.3180020406zbMATH Open0817.05049OpenAlexW2054660610WikidataQ114236263 ScholiaQ114236263MaRDI QIDQ4764660FDOQ4764660
Authors: J. H. Dinitz, David K. Garnick, Brendan D. McKay 
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
Cites Work
Cited In (19)
- Title not available (Why is that?)
- Block colourings of 6-cycle systems
- One-factorisations of complete graphs arising from ovals in finite planes
- The number of Latin squares of order 11
- Three-class association schemes
- On the application of graph colouring techniques in round-robin sports scheduling
- There are 1,132,835,421,602,062,347 nonisomorphic one-factorizations ofK14
- Solving mirrored traveling tournament problem benchmark instances with eight teams
- Switching in one-factorisations of complete graphs
- There are 3155 nonisomorphic perfect one‐factorizations of K16
- Edge coloring: a natural model for sports scheduling
- One-factorizations of complete graphs with vertex-regular automorphism groups
- A classification of hyperfocused 12-arcs
- Embedding 1-factorizations of \(K_n\) in \(PG(2,32)\)
- Factorisation of the complete graph into spanning regular factors
- Recoloring subgraphs of \(K_{2n}\) for sports scheduling
- Enumerating perfect matchings in \(n\)-cubes
- Higher melonic theories
- Multi-neighborhood simulated annealing for the sports timetabling competition ITC2021
This page was built for publication: There are 526,915,620 nonisomorphic one‐factorizations of K12
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4764660)
