The following pages link to (Q3680863):
Displaying 8 items.
- Construction of Hamilton path tournament designs (Q659734) (← links)
- Covering relations, closest orderings and Hamiltonian bypaths in tournaments (Q811322) (← links)
- A note on the number of Hamiltonian paths in strong tournaments (Q813441) (← 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)
- On the maximum number of Hamiltonian paths in tournaments (Q2725034) (← links)
- Slater orders and Hamiltonian paths of tournaments (Q2816068) (← links)
- The complexity of finding certain trees in tournaments (Q5060108) (← links)