On resolvable tree-decompositions of complete graphs

DOI10.1002/JGT.3190120219zbMath0673.05077OpenAlexW2024476606MaRDI QIDQ3826613

Zbigniew Lonc

Publication date: 1988

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.3190120219

zbMATH Keywords

partitiontree decompositionG-decompositionT-decomposition

Mathematics Subject Classification ID

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

Related Items (2)

A survey on the existence ofG-Designs ⋮ Resolvable tree designs

Cites Work

• Unnamed Item

This page was built for publication: On resolvable tree-decompositions of complete graphs