A tournament is a directed graph obtained by assigning a direction for each edge in an undirected complete graph.
In every tournament there’s a Hamiltonian path.
Every strongly connected ^{1} tournament has a Hamiltonian cycle.
Footnotes

strongly connected: a graph is said to be strongly connected if every vertex is reachable from every other vertex ↩