Decomposition of graphs into internally disjoint trees

MaRDI QIDQ3584205zbMATH OpenFDO

Authors

Publication date 27 August 2010

zbMATH Keywords

complete graphcomplete bipartite graphgraphoidal tree coverproduct of path and cycleSmarandache graphoidal tree \((k,d)\)-cover

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 5775505
• On the graphoidal covering number of a graph
• On covering vertices of a graph by trees
• Tree decomposition
• Ascending graphoidal tree cover for product graphs

Cited in

(4)

• Decomposition of complete graphs into arbitrary trees
• Tree decompositions of multigraphs
• scientific article; zbMATH DE number 4087704 (Why is no real title available?)
• scientific article; zbMATH DE number 866654 (Why is no real title available?)

This page was built for publication: Decomposition of graphs into internally disjoint trees

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