No label defined (Q3815328)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4085689
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 4085689 |
Statements
1989
0 references
2-linkage problem
0 references
semicomplete digraph
0 references
tournaments
0 references
0.8609585762023926
0 references
0.8533669710159302
0 references
0.8429666757583618
0 references
0.8330085873603821
0 references
[For the entire collection see Zbl 0656.00008.] This paper deals with finding conditions that a semicomplete digraph (digraph with no nonadjacent vertices) have two disjoint paths with prescribed ends, and the algorithmically equivalent problem of finding a cycle through two given disjoint edges. The author proves for instance this is solvable for 3 connected tournaments and for any 5-connected semicomplete digraph.
0 references