The following publications are possibly variants of this publication:
- Parallel Algorithms for the Hamiltonian Cycle and Hamiltonian Path Problems in Semicomplete Bipartite DigraphsJørgen Bang-Jensen, Mohamed El Haddad, Yannis Manoussakis, Teresa M. Przytycka. algorithmica, 17(1):67-87, 1997.
- A Polynomial Algorithm for Hamiltonian-Connectedness in Semicomplete DigraphsJørgen Bang-Jensen, Yannis Manoussakis, Carsten Thomassen. jal, 13(1):114-127, 1992.
- A Polynomial Time Algorithm for Finding a Cycle Covering a Given Set of Vertices in a Semicomplete Multipartite DigraphAnders Yeo. jal, 33(1):124-139, 1999.
- Cycles and paths in semicomplete multipartite digraphs, theorems, and algorithms: a surveyGregory Gutin. jgt, 19(4):481-505, 1995. [doi]
- Quasi-hamiltonian paths in semicomplete multipartite digraphsJørgen Bang-Jensen, Alessandro Maddaloni, Sven Simonsen. DAM, 161(7-8):889-898, 2013. [doi]
- Sufficient conditions for semicomplete multipartite digraphs to be HamiltonianYubao Guo, Meike Tewes, Lutz Volkmann, Anders Yeo. DM, 212(1-2):91-100, 2000. [doi]
- A sufficient condition for a semicomplete multipartite digraph to be HamiltonianJørgen Bang-Jensen, Gregory Gutin, Jing Huang. DM, 161(1-3):1-12, 1996. [doi]
- A Polynomial Algorithm for the 2-Path Problem for Semicomplete DigraphsJørgen Bang-Jensen, Carsten Thomassen. siamdm, 5(3):366-376, 1992.
- Semicomplete Multipartite DigraphsAnders Yeo. In Jørgen Bang-Jensen, Gregory Z. Gutin, editors, Classes of Directed Graphs. Springer Monographs in Mathematics, pages 297-340, Springer, 2018. [doi]