A simple proof of Ore's theorem on the maximum size of \(k\)-connected graphs with given order and diameter (Q2698536)
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; zbMATH DE number 7677853
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A simple proof of Ore's theorem on the maximum size of \(k\)-connected graphs with given order and diameter |
scientific article; zbMATH DE number 7677853 |
Statements
A simple proof of Ore's theorem on the maximum size of \(k\)-connected graphs with given order and diameter (English)
0 references
24 April 2023
0 references
diameter
0 references
\(k\)-connected graph
0 references
size
0 references
extremal graphs
0 references
