The minimal size of a graph with given generalized 3-edge-connectivity. (Q2804745)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The minimal size of a graph with given generalized 3-edge-connectivity. |
scientific article; zbMATH DE number 6577834
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The minimal size of a graph with given generalized 3-edge-connectivity. |
scientific article; zbMATH DE number 6577834 |
Statements
4 May 2016
0 references
edge connectivity
0 references
Steiner tree
0 references
edge-disjoint trees
0 references
generalized edge connectivity
0 references
The minimal size of a graph with given generalized 3-edge-connectivity. (English)
0 references
0.9236910939216614
0 references
0.8625414371490479
0 references
0.8604164719581604
0 references
0.8526880145072937
0 references
0.8387762308120728
0 references
