On Vertices of Degree <i>n</i> in Minimally <i>n</i>-Edge-Connected Graphs (Q4844492): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1017/s0963548300001498 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2082823229 / rank | |||
Normal rank | |||
Latest revision as of 10:13, 30 July 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
0 references
