A remark on the number of vertices of degree \(k\) in a minimally \(k\)-edge- connected graph (Q1198506): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Minimally n-line connected 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: Kantendisjunkte Wege in Graphen / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3043186 / rank | |||
Normal rank | |||
Revision as of 14:11, 16 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A remark on the number of vertices of degree \(k\) in a minimally \(k\)-edge- connected graph |
scientific article |
Statements
A remark on the number of vertices of degree \(k\) in a minimally \(k\)-edge- connected graph (English)
0 references
16 January 1993
0 references
vertices
0 references
\(k\)-edge-connected graph
0 references
