Pages that link to "Item:Q4500855"
From MaRDI portal
The following pages link to Finding an Oriented Hamiltonian Path in a Tournament (Q4500855):
Displaying 6 items.
- Construction of Hamilton path tournament designs (Q659734) (← links)
- Problems and conjectures concerning connectivity, paths, trees and cycles in tournament-like digraphs (Q1045053) (← links)
- A linear-time algorithm for finding Hamiltonian cycles in tournaments (Q1192953) (← links)
- Fast algorithms for finding Hamiltonian paths and cycles in in-tournament digraphs (Q1208466) (← links)
- Antidirected Hamiltonian paths between specified vertices of a tournament (Q1348380) (← links)
- Oriented Hamiltonian paths in tournaments: A proof of Rosenfeld's conjecture (Q1569075) (← links)