A remark on the number of vertices of degree \(k\) in a minimally \(k\)-edge- connected graph (Q1198506): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| 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 | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0012-365x(92)90445-l / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1972878733 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 10:59, 30 July 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
