On the extremal sizes of maximal graphs without \(( k + 1 )\)-connected subgraphs (Q2197449)
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 the extremal sizes of maximal graphs without \(( k + 1 )\)-connected subgraphs |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the extremal sizes of maximal graphs without \(( k + 1 )\)-connected subgraphs |
scientific article |
Statements
On the extremal sizes of maximal graphs without \(( k + 1 )\)-connected subgraphs (English)
0 references
31 August 2020
0 references
connectivity
0 references
subgraph connectivity
0 references
vertex-\(k\)-maximal graph
0 references
extremal graphs
0 references
