Maximum number of edges in a critically \(k\)-connected graph (Q1861238)
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: Maximum number of edges in a critically \(k\)-connected graph |
scientific article; zbMATH DE number 1882174
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Maximum number of edges in a critically \(k\)-connected graph |
scientific article; zbMATH DE number 1882174 |
Statements
Maximum number of edges in a critically \(k\)-connected graph (English)
0 references
16 March 2003
0 references
The authors determine the largest number of edges in a \(k\)-connected graph with \(n\) vertices with the additional property that the deletion of any vertex results in a graph which is not \(k\)-connected. They also characterize the extremal graphs. This result was conjectured in 1984 by \textit{H. J. Krol} and \textit{H. J. Veldman} [Discrete Math. 52, 225-234 (1984; Zbl 0553.05049)].
0 references
extremal graphs
0 references
