A short proof of the tree-packing theorem

DOI10.1016/j.disc.2012.01.020zbMath1242.05221arXiv0911.2809OpenAlexW2084251294MaRDI QIDQ418872

Tomáš Kaiser

Publication date: 30 May 2012

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0911.2809

zbMATH Keywords

packingspanning tree

Mathematics Subject Classification ID

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

Related Items (7)

On the complexity landscape of connected \(f\)-factor problems ⋮ The complexity of finding low chromatic spanning sub(di)graphs with prescribed connectivity properties ⋮ Spectral conditions for edge connectivity and spanning tree packing number in (multi-)graphs ⋮ Edge-disjoint spanning trees and eigenvalues of regular graphs ⋮ Clustering analysis of a dissimilarity: a review of algebraic and geometric representation ⋮ Complexity of some arc-partition problems for digraphs ⋮ Hamilton cycles in 6-connected claw-free graphs (Extended abstract)

Cites Work

• Unnamed Item
• Unnamed Item
• Hamilton cycles in 5-connected line graphs
• On the Problem of Decomposing a Graph into n Connected Factors
• Edge-Disjoint Spanning Trees of Finite Graphs
• Reflections on graph theory
• Lehmans switching game and a theorem of Tutte and Nash-Williams

This page was built for publication: A short proof of the tree-packing theorem