Resolvable tree designs
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3650602 (Why is no real title available?)
- scientific article; zbMATH DE number 7225155 (Why is no real title available?)
- A Hamiltonian decomposition of \(K^*_{2m},2m\geq 8\)
- Decomposition of a complete multigraph into simple paths: nonbalanced handcuffed designs
- Decomposition of complete multigraphs into stars
- Existence of resolvable path designs
- On resolvable tree-decompositions of complete graphs
- Resolvable path designs
Cited in
(9)- Isomorphic factorizations VIII: Bisectable trees
- Existence of resolvable path designs
- scientific article; zbMATH DE number 68334 (Why is no real title available?)
- Semirotational tree factorizations of complete graphs
- scientific article; zbMATH DE number 4110737 (Why is no real title available?)
- scientific article; zbMATH DE number 2068171 (Why is no real title available?)
- scientific article; zbMATH DE number 4033791 (Why is no real title available?)
- Nonexistence of some T-factorizations of order 12
- The existence of restricted resolvable designs. I: (1,2)-factorizations of \(K_{2n}\)
This page was built for publication: Resolvable tree designs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1200005)