Edge-disjoint minimum-weight connected spanning \(k\)-edge subgraphs in a weighted graph: A connectedness theorem

DOI10.1016/S0012-365X(97)00253-7zbMath0956.05064OpenAlexW2076080102MaRDI QIDQ1584336

Xue Liang Li

Publication date: 2 November 2000

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

Full work available at URL: https://doi.org/10.1016/s0012-365x(97)00253-7

zbMATH Keywords

weighted graphedge-disjoint spanning treesinterpolating theoremgraphical invariants

Mathematics Subject Classification ID

Connectivity (05C40)

Cites Work

• Unnamed Item
• Basis pair graphs of transversal matroids are connected
• Classification of interpolation theorems for spanning trees and other families of spanning subgraphs
• Edge‐disjoint spanning trees: A connectedness theorem

This page was built for publication: Edge-disjoint minimum-weight connected spanning \(k\)-edge subgraphs in a weighted graph: A connectedness theorem