Antidirected Hamiltonian paths between specified vertices of a tournament
From MaRDI portal
Publication:1348380
DOI10.1016/S0166-218X(01)00197-4zbMath0996.05062MaRDI QIDQ1348380
Publication date: 15 May 2002
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
68R10: Graph theory (including graph drawing) in computer science
05C38: Paths and cycles
05C20: Directed graphs (digraphs), tournaments
05C45: Eulerian and Hamiltonian graphs
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Hamiltonian-connected tournaments
- Antidirected Hamiltonian circuits in tournaments
- Oriented Hamiltonian paths in tournaments: A proof of Rosenfeld's conjecture
- Antidirected Hamilton circuits and paths in tournaments
- The complexity of finding generalized paths in tournaments
- Paths and Cycles in Tournaments
- Fast parallel algorithms for finding hamiltonian paths and cycles in a tournament
- A polynomial algorithm for hamiltonian-connectedness in semicomplete digraphs
- Antidirected Hamiltonian paths in tournaments
- Antidirected Hamiltonian paths in tournaments