There are 526,915,620 nonisomorphic one‐factorizations of K12
From MaRDI portal
Publication:4764660
Cites work
Cited in
(19)- scientific article; zbMATH DE number 1228802 (Why is no real title available?)
- One-factorisations of complete graphs arising from ovals in finite planes
- Block colourings of 6-cycle systems
- 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
- Embedding 1-factorizations of K_n in PG(2,32)
- A classification of hyperfocused 12-arcs
- Factorisation of the complete graph into spanning regular factors
- Enumerating perfect matchings in n-cubes
- Recoloring subgraphs of \(K_{2n}\) for sports scheduling
- 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)