Decomposition of complete graphs into arbitrary trees

DOI10.1007/S00373-021-02299-5MaRDI QIDQ2042202zbMATH OpenOpenAlexFDO

Authors G. Sethuraman, V. Murugan

Publication date 28 July 2021

Published in Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00373-021-02299-5

zbMATH Keywords

graph decompositiontree decompositionRingel conjecture

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 866654
• Decompositions of graphs into trees
• Tree decomposition of graphs
• Tree decompositions for a class of graphs
• Decomposition of graphs into internally disjoint trees
• Decompositions of graphs into trees, forests, and regular subgraphs
• Decompositions of Complete Graphs
• Decomposition of some planar graphs into trees
• Tree decompositions of multigraphs
• Tree-decompositions of graphs. I

Cites work

• scientific article; zbMATH DE number 2192102 (Why is no real title available?)
• scientific article; zbMATH DE number 3308125 (Why is no real title available?)
• A survey on the existence ofG-Designs
• Cycle decompositions of K_n and K_n-I
• Cycle decompositions. III: Complete graphs and fixed length cycles.
• Decomposition of a complete multigraph into simple paths: nonbalanced handcuffed designs
• Decomposition of complete graphs into paths and stars
• Decompositions of complete graphs into paths and cycles.
• On claw-decomposition of complete graphs and complete bigraphs
• On the cyclic decomposition of complete graphs into bipartite graphs

Cited in

(24)

• Decomposition of Cartesian products of regular graphs into isomorphic trees
• Gregarious \(Y_5\)-tree decompositions of tensor product of complete graphs
• Every tree is a large subtree of a tree that decomposes \(K_n\) or \(K_{n,n}\)
• Decomposition into two trees with orientation constraints
• scientific article; zbMATH DE number 5917571 (Why is no real title available?)
• scientific article; zbMATH DE number 1247777 (Why is no real title available?)
• Tree decompositions of multigraphs
• Decomposing almost complete graphs by random trees
• scientific article; zbMATH DE number 4087704 (Why is no real title available?)
• On resolvable tree-decompositions of complete graphs
• Multi-decomposition of graphs into paths and Y-trees of order five
• scientific article; zbMATH DE number 1556732 (Why is no real title available?)
• Decomposition of graphs into trees of order five
• On a problem of Fronček and Kubesa
• Tree decomposition
• scientific article; zbMATH DE number 866654 (Why is no real title available?)
• scientific article; zbMATH DE number 4150219 (Why is no real title available?)
• Null decomposition of trees
• Generation of trees of a graph with the use of decomposition
• A proof of Ringel's conjecture
• Decomposing almost complete graphs by random trees
• New attack on Kotzig's conjecture
• On decompositions of the Johnson graph
• Decomposing hypergraphs into simple hypertrees

This page was built for publication: Decomposition of complete graphs into arbitrary trees

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