scientific article; zbMATH DE number 4085689

From MaRDI portal
Publication:3815328





[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.











This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3815328)