A tight bound on the collection of edges in MSTs of induced subgraphs
From MaRDI portal
Publication:1003845
DOI10.1016/j.jctb.2008.08.008zbMath1229.05156arXiv0705.2439OpenAlexW2048801052MaRDI QIDQ1003845
Gregory B. Sorkin, Angelika Steger, Rico Zenklusen
Publication date: 4 March 2009
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0705.2439
MSTminimum spanning treevertex connectivityMenger's theoremMader's theoremminimal \(k\)-connected graph
Related Items (1)
Cites Work
This page was built for publication: A tight bound on the collection of edges in MSTs of induced subgraphs