On extremal graphs with at most \(\ell\) internally disjoint Steiner trees connecting any \(n-1\) vertices (Q897279)
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: On extremal graphs with at most internally disjoint Steiner trees connecting any n-1 vertices |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On extremal graphs with at most \(\ell\) internally disjoint Steiner trees connecting any \(n-1\) vertices |
scientific article |
Statements
On extremal graphs with at most \(\ell\) internally disjoint Steiner trees connecting any \(n-1\) vertices (English)
0 references
17 December 2015
0 references
(edge-)connectivity
0 references
Steiner tree
0 references
internally (edge-)disjoint trees
0 references
packing
0 references
generalized local (edge-)connectivity
0 references
0.910883605480194
0 references
0.8836827278137207
0 references
0.8558350205421448
0 references
0.8320884108543396
0 references
0.8107596039772034
0 references
