Highly connected non-2-linked digraphs (Q1181017): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| (4 intermediate revisions by 3 users not shown) | |||
| Property / reviewed by | |||
| Property / reviewed by: John W. Moon / rank | |||
| Property / reviewed by | |||
| Property / reviewed by: John W. Moon / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Cycles in digraphs– a survey / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The directed subgraph homeomorphism problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: 2-linked graphs / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 14:15, 15 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Highly connected non-2-linked digraphs |
scientific article |
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
