On extremal graphs with at most \(\ell\) internally disjoint Steiner trees connecting any \(n-1\) vertices (Q897279): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Changed an Item |
||
| Property / arXiv ID | |||
| Property / arXiv ID: 1304.3774 / rank | |||
Normal rank | |||
Revision as of 18:36, 18 April 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
