Packing spanning trees and spanning 2-connected \(k\)-edge-connected essentially \((2k-1)\)-edge-connected subgraphs (Q2359795)
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 6734718
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Packing spanning trees and spanning 2-connected \(k\)-edge-connected essentially \((2k-1)\)-edge-connected subgraphs |
scientific article; zbMATH DE number 6734718 |
Statements
Packing spanning trees and spanning 2-connected \(k\)-edge-connected essentially \((2k-1)\)-edge-connected subgraphs (English)
0 references
22 June 2017
0 references
spanning tree
0 references
essentially connected
0 references
orientation
0 references
\(k\)-rigid
0 references
0.8932549953460693
0 references
0.8737790584564209
0 references
0.8709306716918945
0 references
0.865063488483429
0 references
0.8526515364646912
0 references
