On the structure of locally semicomplete digraphs
- 1 May 1992
- journal article
- Published by Elsevier in Discrete Mathematics
- Vol. 100 (1-3) , 243-265
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- A Polynomial Algorithm for the 2-Path Problem for Semicomplete DigraphsSIAM Journal on Discrete Mathematics, 1992
- A polynomial algorithm for hamiltonian-connectedness in semicomplete digraphsJournal of Algorithms, 1992
- Highly connected non-2-linked digraphsCombinatorica, 1991
- Locally semicomplete digraphs: A generalization of tournamentsJournal of Graph Theory, 1990
- Cycles of each length in tournamentsJournal of Combinatorial Theory, Series B, 1982
- A relationship between triangulated graphs, comparability graphs, proper interval graphs, proper circular‐arc graphs, and nested interval graphsJournal of Graph Theory, 1982
- Edge-Disjoint Hamiltonian Paths and Cycles in TournamentsProceedings of the London Mathematical Society, 1982
- Hamiltonian-connected tournamentsJournal of Combinatorial Theory, Series B, 1980
- The directed subgraph homeomorphism problemTheoretical Computer Science, 1980
- Matrix characterizations of circular-arc graphsPacific Journal of Mathematics, 1971