Longest paths in semicomplete multipartite digraphs (Q1297460)

A digraph obtained by replacing each edge of a complete multipartite graph by an arc or a pair of mutually opposite arcs is called a semicomplete multipartite digraph. The author studies some properties of longest paths in semicomplete multipartite digraphs. He characterizes semicomplete \(n\)-partite digraphs whose longest path is of order \(n\), and states the problem to characterize semicomplete \(n\)-particle digraphs whose longest cycle is of order \(n\).