Cycles and paths in semicomplete multipartite digraphs, theorems, and algorithms: a survey
- 1 July 1995
- journal article
- research article
- Published by Wiley in Journal of Graph Theory
- Vol. 19 (4) , 481-505
- https://doi.org/10.1002/jgt.3190190405
Abstract
No abstract availableKeywords
This publication has 44 references indexed in Scilit:
- A tour through tournaments or bipartite and ordinary tournaments: a comparative surveyPublished by Cambridge University Press (CUP) ,2010
- Cycles throughk vertices in bipartite tournamentsCombinatorica, 1994
- A polynomial algorithm for hamiltonian-connectedness in semicomplete digraphsJournal of Algorithms, 1992
- The number of bipartite tournaments with a unique given factorJournal of Graph Theory, 1989
- Fast parallel algorithms for finding hamiltonian paths and cycles in a tournamentJournal of Algorithms, 1988
- The radii of n-partite tournamentsMathematical Notes, 1986
- Note on the existence of directed (k + 1)‐cycles in diconnected complete k‐partite digraphsJournal of Graph Theory, 1984
- The complexity of finding generalized paths in tournamentsJournal of Algorithms, 1983
- The number of tournaments with a unique spanning cycleJournal of Graph Theory, 1982
- Upper bounds for permanents of $left( {0,,1}
ight)$-matricesBulletin of the American Mathematical Society, 1963