The number of cut vertices and cut arcs in a strong directed graph (Q5645443): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q3277097 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On basis diagraphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An extremal problem in graph theory / rank | |||
Normal rank | |||
Latest revision as of 11:04, 12 June 2024
scientific article; zbMATH DE number 3373793
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The number of cut vertices and cut arcs in a strong directed graph |
scientific article; zbMATH DE number 3373793 |
Statements
The number of cut vertices and cut arcs in a strong directed graph (English)
0 references
1972
0 references
