On the complexity of hamiltonian path and cycle problems in certain classes of digraphs
This is the most comprehensive and updated survey article with very detailed information and discussion about results on sequential and parallel complexity of hamiltonian problems for various classes of directed graphs that generalize tournaments (such as, locally in-semicomplete digraphs, semicomplete multipartite digraphs, path-mergeable digraphs, quasi-transitive digraphs, etc.). A few new results about hamiltonian path starting at a given vertex for some digraphs are also proved in this paper.
tournament locally in-semicomplete digraph
scientific article; zbMATH DE number 1340625