Highly connected non-2-linked digraphs (Q1181017)
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: Highly connected non-2-linked digraphs |
scientific article; zbMATH DE number 27537
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Highly connected non-2-linked digraphs |
scientific article; zbMATH DE number 27537 |
Statements
Highly connected non-2-linked digraphs (English)
0 references
27 June 1992
0 references
A digraph \(D\) is said to be 2-linked if for any four vertices \(x_ 1\), \(x_ 2\), \(y_ 1\), and \(y_ 2\) there exist disjoint directed paths \(P_ 1\) and \(P_ 2\) starting at \(x_ 1\) and \(x_ 2\) and ending at \(y_ 1\) and \(y_ 2\), respectively. The author shows that for every positive integers \(k\) there exists a strongly \(k\)-connected digraph \(D\) that is not 2-linked.
0 references
directed graphs
0 references
paths
0 references
