Disjoint Paths in Decomposable Digraphs
From MaRDI portal
Publication:5272934
DOI10.1002/jgt.22090zbMath1365.05106OpenAlexW4230709412MaRDI QIDQ5272934
Tilde My Christiansen, Alessandro Maddaloni, Jörgen Bang-Jensen
Publication date: 5 July 2017
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.22090
polynomial algorithmlocally semicomplete digraphdisjoint pathsquasi-transitive digraph\(k\)-linkage problem(round-)decomposable digraphs
Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Directed graphs (digraphs), tournaments (05C20)
Related Items (3)
Disjoint paths in unions of tournaments ⋮ Locally Semicomplete Digraphs and Generalizations ⋮ Quasi-Transitive Digraphs and Their Extensions
Cites Work
- Disjoint paths in tournaments
- The directed subgraph homeomorphism problem
- Highly connected non-2-linked digraphs
- Linkages in locally semicomplete digraphs and quasi-transitive digraphs
- A classification of locally semicomplete digraphs
- Directed tree-width
- Graph minors. XIII: The disjoint paths problem
- On the structure of local tournaments
- Arc-Disjoint Paths in Decomposable Digraphs
- Locally semicomplete digraphs: A generalization of tournaments
- A Polynomial Algorithm for the 2-Path Problem for Semicomplete Digraphs
- Connectivity properties of locally semicomplete digraphs
- Quasi‐transitive digraphs
This page was built for publication: Disjoint Paths in Decomposable Digraphs