A tight bound on the collection of edges in MSTs of induced subgraphs (Q1003845)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5523278
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A tight bound on the collection of edges in MSTs of induced subgraphs |
scientific article; zbMATH DE number 5523278 |
Statements
A tight bound on the collection of edges in MSTs of induced subgraphs (English)
0 references
4 March 2009
0 references
minimum spanning tree
0 references
MST
0 references
vertex connectivity
0 references
Mader's theorem
0 references
Menger's theorem
0 references
minimal \(k\)-connected graph
0 references
0.7716392278671265
0 references
0.7695699334144592
0 references
0.7646569013595581
0 references
0.750532865524292
0 references
0.7505326271057129
0 references
