Cycles through \(k\) vertices in bipartite tournaments
From MaRDI portal
Publication:1330800
DOI10.1007/BF01215353zbMath0812.05023MaRDI QIDQ1330800
Yannis Manoussakis, Jörgen Bang-Jensen
Publication date: 11 August 1994
Published in: Combinatorica (Search for Journal in Brave)
68R10: Graph theory (including graph drawing) in computer science
05C38: Paths and cycles
05C20: Directed graphs (digraphs), tournaments
05C40: Connectivity
Related Items
Cites Work
- Unnamed Item
- The directed subgraph homeomorphism problem
- Highly connected non-2-linked digraphs
- Cycles and paths in bipartite tournaments with spanning configurations
- Polynomial Algorithms for Finding Cycles and Paths in Bipartite Tournaments
- A Polynomial Algorithm for the 2-Path Problem for Semicomplete Digraphs