Min-max Relations for Directed Graphs (Q3960724)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Min-max Relations for Directed Graphs |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Min-max Relations for Directed Graphs |
scientific article |
Statements
Min-max Relations for Directed Graphs (English)
0 references
1982
0 references
pairwise disjoint strong connectors
0 references
strong cut
0 references
Menger's theorem
0 references
Edmonds' branching theorem
0 references
