A polynomial algorithm for hamiltonian-connectedness in semicomplete digraphs

J. Bang-Jensen and C. Thomassen, A polynomial algorithm for the 2-path problem for semicomplete digraphs, SIAM J. Discrete Math., to appear. Bondy, 1976 Y. Manoussakis, “A Linear Algorithm for Finding Hamiltonian Cycles in Tournaments,” Discrete Math., to appear. Soroker, 1988, Fast parallel algorithms for finding Hamiltonian paths and cycles in tournaments, J. Algorithms, 9, 276, 10.1016/0196-6774(88)90042-9 Thomassen, 1980, Hamiltonian connected tournaments, J. Combin. Theory Ser. B, 28, 142, 10.1016/0095-8956(80)90061-1