The following pages link to Resolvable tree designs (Q1200005):
Displaying 6 items.
- The existence of restricted resolvable designs. I: (1,2)-factorizations of \(K_{2n}\) (Q914680) (← links)
- Existence of resolvable path designs (Q923105) (← links)
- Isomorphic factorizations VIII: Bisectable trees (Q1060225) (← links)
- Factorizations of \(K_{m,n}\) into spanning trees (Q1808713) (← links)
- Semirotational tree factorizations of complete graphs (Q2739718) (← links)
- Nonexistence of some T-factorizations of order 12 (Q3411248) (← links)