On the structure of locally semicomplete digraphs
From MaRDI portal
Publication:1198647
DOI10.1016/0012-365X(92)90645-VzbMath0759.05040OpenAlexW1972488642WikidataQ127871738 ScholiaQ127871738MaRDI QIDQ1198647
Publication date: 16 January 1993
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0012-365x(92)90645-v
Related Items (11)
On complementary cycles in locally semicomplete digraphs ⋮ A classification of locally semicomplete digraphs ⋮ Path-connectivity in local tournaments ⋮ Paths and cycles in extended and decomposable digraphs ⋮ Cycles of all lengths in arc-3-cyclic semicomplete digraphs ⋮ On the exponent set of primitive locally semicomplete digraphs ⋮ Locally semicomplete digraphs: A generalization of tournaments ⋮ All 2-connected in-tournaments that are cycle complementary ⋮ Weakly Hamiltonian-connected ordinary multipartite tournaments ⋮ Linkages in locally semicomplete digraphs and quasi-transitive digraphs ⋮ Locally Semicomplete Digraphs and Generalizations
Cites Work
- The directed subgraph homeomorphism problem
- Hamiltonian-connected tournaments
- Cycles of each length in tournaments
- Highly connected non-2-linked digraphs
- Matrix characterizations of circular-arc graphs
- Locally semicomplete digraphs: A generalization of tournaments
- Edge-Disjoint Hamiltonian Paths and Cycles in 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
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: On the structure of locally semicomplete digraphs