Linkages in locally semicomplete digraphs and quasi-transitive digraphs
From MaRDI portal
Publication:1297397
DOI10.1016/S0012-365X(98)00194-0zbMath0929.05036OpenAlexW2018551116MaRDI QIDQ1297397
Publication date: 11 January 2000
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0012-365x(98)00194-0
Related Items (4)
\(k\)-strong spanning local tournaments in locally semicomplete digraphs ⋮ Locally Semicomplete Digraphs and Generalizations ⋮ Quasi-Transitive Digraphs and Their Extensions ⋮ Disjoint Paths in Decomposable Digraphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The 2-linkage problem for acyclic digraphs
- Edge-disjoint in- and out-branchings in tournaments and related path problems
- The directed subgraph homeomorphism problem
- On the structure of locally semicomplete digraphs
- A classification of locally semicomplete digraphs
- Vertex heaviest paths and cycles in quasi-transitive digraphs
- On \(k\)-strong and \(k\)-cyclic digraphs
- Paths and cycles in extended and decomposable digraphs
- Kings in quasi-transitive digraphs
- Weakly Hamiltonian-connected ordinary multipartite tournaments
- On the structure of local tournaments
- Characterization of vertex pancyclic and pancyclic ordinary complete multipartite digraphs
- Locally semicomplete digraphs: A generalization of tournaments
- A relationship between triangulated graphs, comparability graphs, proper interval graphs, proper circular-arc graphs, and nested interval graphs
- A Polynomial Algorithm for the 2-Path Problem for Semicomplete Digraphs
- Generalizations of tournaments: A survey
- Quasi‐transitive digraphs
- Strongly Hamiltonian-connected locally semicomplete digraphs
- Transitiv orientierbare Graphen
This page was built for publication: Linkages in locally semicomplete digraphs and quasi-transitive digraphs
