Edge‐disjoint spanning trees: A connectedness theorem
From MaRDI portal
Publication:3708038
DOI10.1002/jgt.3190090303zbMath0583.05023OpenAlexW1972083652MaRDI QIDQ3708038
Herbert S. Shank, Martin Farber, R. Bruce Richter
Publication date: 1985
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.3190090303
Related Items (15)
Hamiltonicity of a type of interchange graphs ⋮ On the toric ideals of matroids of a fixed rank ⋮ Basis pair graphs of transversal matroids are connected ⋮ On Serial Symmetric Exchanges of Matroid Bases ⋮ Serial exchanges in matroids ⋮ Frame matroids, toric ideals, and a conjecture of White ⋮ Weighted exchange distance of basis pairs ⋮ Disjoint compatible geometric matchings ⋮ Exchange Distance of Basis Pairs in Split Matroids ⋮ On a base exchange game on bispanning graphs ⋮ Bases-cobases graphs and polytopes of matroids ⋮ On Sequential Basis Exchange in Matroids ⋮ A problem of tree graph ⋮ Edge-disjoint minimum-weight connected spanning \(k\)-edge subgraphs in a weighted graph: A connectedness theorem ⋮ On the basis pair graphs of signed-graphic matroids
Cites Work
This page was built for publication: Edge‐disjoint spanning trees: A connectedness theorem
