Regular ArticleFinding an Oriented Hamiltonian Path in a Tournament
References (7)
- et al.
Oriented hamiltonian paths in tournaments: A proof of Rosenfeld's conjecture
J. Combin. Theory Ser. B
(2000) - et al.
The complexity of finding generalized paths in tournaments
J. Algorithms
(1983) A linear-time algorithm for finding Hamiltonian cycles in tournaments
Discrete Appl. Math.
(1992)
There are more references available in the full text version of this article.
Cited by (1)
Problems and conjectures concerning connectivity, paths, trees and cycles in tournament-like digraphs
2009, Discrete Mathematics
Copyright © 2000 Academic Press. All rights reserved.