The following pages link to (Q4332941):
Displaying 50 items.
- Cubic factorizations (Q383761) (← links)
- Switching in one-factorisations of complete graphs (Q405262) (← links)
- A multi-round generalization of the traveling tournament problem and its application to Japanese baseball (Q421692) (← links)
- Abelian 1-factorizations in infinite graphs (Q709254) (← links)
- Developing an algorithm for triad design (Q712558) (← links)
- Graph factors and factorization: 1985--2003: a survey (Q868347) (← links)
- \(k\) -factors in regular graphs (Q943560) (← links)
- Symmetric 1-factorizations of the complete graph (Q976163) (← links)
- Factorization of \(K_{n,n}\) into \((0,j)\)-prisms (Q989530) (← links)
- \(k\)-pyramidal one-factorizations (Q995770) (← links)
- An application of Tutte's theorem to 1-factorization of regular graphs of high degree (Q1044942) (← links)
- Spanning cubic graph designs (Q1045074) (← links)
- Global constraints for round robin tournament scheduling. (Q1417492) (← links)
- \(f\)-factors in bipartite (\(mf\))-graphs (Q1421483) (← links)
- Ladder orderings of pairs and RAID performance. (Q1428550) (← links)
- A family of perfect factorisations of complete bipartite graphs (Q1601439) (← links)
- Factorization of de Bruijn digraphs by cycle-rooted trees (Q1603418) (← links)
- A new neighborhood structure for round robin scheduling problems (Q1651632) (← links)
- Minimization of rest mismatches in round robin tournaments (Q1654351) (← links)
- Randomly orthogonal factorizations with constraints in bipartite networks (Q1663915) (← links)
- One-factorisations of complete graphs arising from ovals in finite planes (Q1671774) (← links)
- Orthogonally resolvable matching designs (Q1690232) (← links)
- Uniform Lie algebras and uniformly colored graphs (Q1707419) (← links)
- Rainbow spanning tree decompositions in complete graphs colored by cyclic 1-factorizations (Q1727772) (← links)
- One-factorizations of regular graphs of order 12 (Q1773192) (← links)
- Randomly orthogonal \((g,f)\)-factorizations in graphs (Q1862827) (← links)
- Semi-perfect 1-factorizations of the hypercube (Q1999735) (← links)
- Spanning tree decompositions of complete graphs orthogonal to rotational 1-factorizations (Q2014215) (← links)
- Recoloring subgraphs of \(K_{2n}\) for sports scheduling (Q2034794) (← links)
- Large sets with multiplicity (Q2035460) (← links)
- Decompositions of line graphs of complete graphs into paths and cycles (Q2092392) (← links)
- Efficient, local and symmetric Markov chains that generate one-factorizations (Q2216928) (← links)
- A new large \(N\) expansion for general matrix-tensor models (Q2323505) (← links)
- On circular--linear one-factorizations of the complete graph (Q2329207) (← links)
- A quantitative approach to perfect one-factorizations of complete bipartite graphs (Q2341065) (← links)
- New families of atomic Latin squares and perfect 1-factorisations. (Q2490859) (← links)
- Small regular graphs of girth 7 (Q2517652) (← links)
- On \((g,f)\)-uniform graphs (Q2577646) (← links)
- \((g, f)\)-factorizations randomly orthogonal to a subgraph in graphs (Q2581162) (← links)
- Perfect one-factorizations arising from the Lee metric (Q2680575) (← links)
- One-factorizations of complete graphs with vertex-regular automorphism groups (Q2782293) (← links)
- Orthogonally Resolvable Cycle Decompositions (Q2950653) (← links)
- Symmetric Hamilton cycle decompositions of complete graphs minus a 1-factor (Q3072529) (← links)
- Perfect 1-Factorizations of a Family of Cayley Graphs (Q3465907) (← links)
- On minimum sets of 1-factors covering a complete multipartite graph (Q3522849) (← links)
- A CONSTRUCTION OF ONE-FACTORIZATION (Q3530374) (← links)
- Grooming for two-period optical networks (Q3548732) (← links)
- Cryptosystems involving one-factorizations of graphs (Q3574297) (← links)
- Rainbow and orthogonal paths in factorizations of<i>K</i><i>n</i> (Q3576975) (← links)
- There are 1,132,835,421,602,062,347 nonisomorphic one-factorizations of<i>K</i><sub>14</sub> (Q3619607) (← links)
