Kritisch n-fach kantenzusammenhängende Graphen. (Critically n-edge- connected graphs) (Q1066913): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Critically n-Connected Graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A theorem on n-connected graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Minimally n-line connected graphs. / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3043186 / rank | |||
Normal rank | |||
Latest revision as of 19:37, 14 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Kritisch n-fach kantenzusammenhängende Graphen. (Critically n-edge- connected graphs) |
scientific article |
Statements
Kritisch n-fach kantenzusammenhängende Graphen. (Critically n-edge- connected graphs) (English)
0 references
1986
0 references
See the preview in Zbl 0563.05040.
0 references
critically n-edge-connected graphs
0 references
