The following pages link to (Q4332941):
Displaying 9 items.
- Orthogonal (g, f)-factorizations in networks (Q4506268) (← links)
- PERFECT 1-FACTORISATIONS OF (Q5222133) (← links)
- Edge-disjoint Hamilton cycles in random graphs (Q5252256) (← links)
- Nilpotent 1-factorizations of the complete graph (Q5711783) (← links)
- On the convergence of the mild random walk algorithm to generate random one-factorizations of complete graphs (Q5865698) (← links)
- 1-factorizations of complete multigraphs arising from finite geometry (Q5930030) (← links)
- Explicit Baranyai partitions for quadruples, Part I: Quadrupling constructions (Q6145733) (← links)
- There are 3155 nonisomorphic perfect one‐factorizations of <i>K</i><sub>16</sub> (Q6185551) (← links)
- An improved recursive construction for disjoint Steiner quadruple systems (Q6187452) (← links)