An in-tournament digraph is a digraph in which the set of in-neighbours of every vertex induces a tournament. For in-tournament diagraphs the authors give O(m+nlogn) algorithms to find a Hamiltonian path and a Hamiltonian cycle if they exist. Here n,m denote the number of vertices respectively arcs of the in-tournament diagraph.
