A simple proof of Ore's theorem on the maximum size of k-connected graphs with given order and diameter (Q6393613)
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: A simple proof of Ore's theorem on the maximum size of k-connected graphs with given order and diameter |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A simple proof of Ore's theorem on the maximum size of k-connected graphs with given order and diameter |
scientific article |
Statements
14 March 2022
0 references
math.CO
0 references
