Vertices of small degree in critically \(n\)-connected digraphs (Q1186137)
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: Vertices of small degree in critically \(n\)-connected digraphs |
scientific article; zbMATH DE number 36246
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Vertices of small degree in critically \(n\)-connected digraphs |
scientific article; zbMATH DE number 36246 |
Statements
Vertices of small degree in critically \(n\)-connected digraphs (English)
0 references
28 June 1992
0 references
The author shows that every critically \(n\)-connected finite digraph has a node \(u\) that either the outdegree or the indegree of \(u\) is less than \(2n\).
0 references
degree
0 references
critically \(n\)-connected digraph
0 references
0 references
