On Vertices of Degree <i>n</i> in Minimally <i>n</i>-Edge-Connected Graphs (Q4844492): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 04:08, 8 February 2024
scientific article; zbMATH DE number 790738
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On Vertices of Degree <i>n</i> in Minimally <i>n</i>-Edge-Connected Graphs |
scientific article; zbMATH DE number 790738 |
Statements
On Vertices of Degree <i>n</i> in Minimally <i>n</i>-Edge-Connected Graphs (English)
0 references
27 August 1995
0 references
lower bound
0 references
minimally \(n\)-edge-connected graph
0 references
