On Vertices of Degree <i>n</i> in Minimally <i>n</i>-Edge-Connected Graphs (Q4844492): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: The number of vertices of degree \(k\) in a minimally \(k\)-edge connected graph / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A remark on the number of vertices of degree \(k\) in a minimally \(k\)-edge- connected graph / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Indestructive deletions of edges from graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Minimale \(n\)-fach kantenzusammenhängende Graphen / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A Reduction Method for Edge-Connectivity in Graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Kantendisjunkte Wege in Graphen / rank | |||
Normal rank | |||
Revision as of 15:58, 23 May 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
