An upper bound for orders of certain \((k,\bar k)\)-connected graphs (Q1343278)
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: An upper bound for orders of certain \((k,\bar k)\)-connected graphs |
scientific article; zbMATH DE number 716471
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An upper bound for orders of certain \((k,\bar k)\)-connected graphs |
scientific article; zbMATH DE number 716471 |
Statements
An upper bound for orders of certain \((k,\bar k)\)-connected graphs (English)
0 references
1 February 1995
0 references
upper bound
0 references
orders
0 references
critical graph
0 references
connected graph
0 references
components
0 references
minimum cut
0 references
connectivity
0 references
elemental fragments
0 references
