Resolvable tree designs

DOI10.1016/0097-3165(92)90027-RzbMath0769.05079OpenAlexW2048121132MaRDI QIDQ1200005

Min-Li Yu

Publication date: 17 January 1993

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0097-3165(92)90027-r

zbMATH Keywords

treefactorizationcomplete graph

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

• Existence of resolvable path designs
• Resolvable path designs
• Decomposition of complete multigraphs into stars
• A Hamiltonian decomposition of \(K^*_{2m},2m\geq 8\)
• Decomposition of a complete multigraph into simple paths: nonbalanced handcuffed designs
• On resolvable tree-decompositions of complete graphs
• Unnamed Item
• Unnamed Item

This page was built for publication: Resolvable tree designs