A short proof of the tree-packing theorem
From MaRDI portal
Publication:418872
DOI10.1016/j.disc.2012.01.020zbMath1242.05221arXiv0911.2809MaRDI QIDQ418872
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
05C05: Trees
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
Related Items
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, 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, Hamilton cycles in 6-connected claw-free graphs (Extended abstract)
Cites Work