Decomposition of complete graphs into arbitrary trees

DOI10.1007/S00373-021-02299-5zbMath1472.05128OpenAlexW3157901174MaRDI QIDQ2042202

G. Sethuraman, Veerapazham 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

tree decompositiongraph 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)

Cites Work

• Decomposition of complete graphs into paths and stars
• On claw-decomposition of complete graphs and complete bigraphs
• Decomposition of a complete multigraph into simple paths: nonbalanced handcuffed designs
• Cycle decompositions of \(K_n\) and \(K_n-I\)
• Cycle decompositions III: Complete graphs and fixed length cycles
• A survey on the existence ofG-Designs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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