Abstract: We give a short elementary proof of Tutte and Nash-Williams' characterization of graphs with k edge-disjoint spanning trees.
Cites work
- Edge-Disjoint Spanning Trees of Finite Graphs
- Hamilton cycles in 5-connected line graphs
- scientific article; zbMATH DE number 3862930 (Why is no real title available?)
- scientific article; zbMATH DE number 2203240 (Why is no real title available?)
- Lehmans switching game and a theorem of Tutte and Nash-Williams
- On the Problem of Decomposing a Graph into n Connected Factors
- Reflections on graph theory
Cited in
(11)- 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
- An approximate version of the tree packing conjecture
- A simple proof of the shallow packing lemma
- Hamilton cycles in 6-connected claw-free graphs (extended abstract)
- Edge-disjoint spanning trees and eigenvalues of regular graphs
- On packing low-diameter spanning trees
- Tree-packing revisited: faster fully dynamic min-cut and arboricity
- Clustering analysis of a dissimilarity: a review of algebraic and geometric representation
This page was built for publication: A short proof of the tree-packing theorem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q418872)
