Purely heterogeneous spanning tree decompositions

MaRDI QIDQ3165985zbMATH OpenFDO

Authors Roger B. Eggleton, Sayun Sotaro, Michael J. Plantholt

Publication date 21 October 2012

zbMATH Keywords

decompositions with the maximum degree conditionnear-complete graphsspanning trees

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Graph designs and isomorphic decomposition (05C51) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Reducible and purely heterogeneous decompositions of uniform complete multigraphs into spanning trees
• On heterogeneous decompositions of uniform complete multigraphs into spanning trees
• A note on heterogeneous decompositions into spanning trees
• scientific article; zbMATH DE number 2154966
• Decompositions and factorizations of complete graphs

Cited in

(3)

• On heterogeneous decompositions of uniform complete multigraphs into spanning trees
• Reducible and purely heterogeneous decompositions of uniform complete multigraphs into spanning trees
• A note on heterogeneous decompositions into spanning trees

This page was built for publication: Purely heterogeneous spanning tree decompositions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3165985)