Cycles and paths in bipartite tournaments with spanning configurations
- 1 March 1989
- journal article
- Published by Springer Nature in Combinatorica
- Vol. 9 (1) , 33-38
- https://doi.org/10.1007/bf02122681
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- Polynomial Algorithms for Finding Cycles and Paths in Bipartite TournamentsSIAM Journal on Discrete Mathematics, 1990
- Cycles in bipartite tournamentsJournal of Combinatorial Theory, Series B, 1982
- Long paths and cycles in oriented graphsJournal of Graph Theory, 1981
- The directed subgraph homeomorphism problemTheoretical Computer Science, 1980