Cycles and paths in semicomplete multipartite digraphs, theorems, and algorithms: a survey
Gregory Gutin · Journal of Graph Theory · 1995
Abstract A digraph obtained by replacing each edge of a complete m‐partite graph by an arc or a pair of mutually opposite arcs with the same end vertices is calied a semicomplete m‐partite digraph. We describe results (theorems and algorithms) on directed walks in semicomplete m‐partite digraphs, including some recent results concerning tournaments. © 1995 John Wiley & Sons, Inc.