Minimale \(n\)-fach kantenzusammenhängende Graphen (Q2539992): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / cites work | |||
| Property / cites work: A theorem on n-connected graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Minimale n-fach zusammenhängende Graphen mit maximaler Kantenzahl. / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Existenz n-fach zusammenhängender Teilgraphen in Graphen genügend großer Kantendichte / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Über den Zusammenhang symmetrischer Graphen / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Connectivity of transitive graphs / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2057250066 / rank | |||
Normal rank | |||
Latest revision as of 11:04, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Minimale \(n\)-fach kantenzusammenhängende Graphen |
scientific article |
Statements
Minimale \(n\)-fach kantenzusammenhängende Graphen (English)
0 references
1971
0 references
