Über minimal n-fach zusammenhängende, unendliche Graphen und ein Extremalproblem. (On minimal n-fold connected infinite graphs and an extremal problem) (Q2549705): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Minimally 2-connected graphs. / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5589123 / 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: Ecken vom Grad \(n\) in minimalen \(n\)-fach zusammenhängenden Graphen / rank | |||
Normal rank | |||
Latest revision as of 04:07, 12 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Über minimal n-fach zusammenhängende, unendliche Graphen und ein Extremalproblem. (On minimal n-fold connected infinite graphs and an extremal problem) |
scientific article |
Statements
Über minimal n-fach zusammenhängende, unendliche Graphen und ein Extremalproblem. (On minimal n-fold connected infinite graphs and an extremal problem) (English)
0 references
1972
0 references
