\(c\)-pancyclic partial ordering and \((c-1)\)-pan-outpath partial ordering in semicomplete multipartite digraphs. (Q1421090)

A semicomplete \(n\)-partite digraph is a digraph obtained from a complete \(n\)-partite graph by replacing each edge with an arc, or a pair of mutually opposite arcs with the same vertices. A semicomplete \(n\)-partite digraph \(D\) with \(n\geq 3\) has an \(n\)-pancyclic partial ordering from \(v\in V(D)\), if there are \(n\) vertices in \(D\) that can be labelled \(v= x_1,x_2,\dots, x_n\) such that \(D[\{x_1, x_2,\dots, x_t\}]\) is Hamiltonian for each \(3\leq t\leq n\). The authors prove that every strong semicomplete \(n\)-partite digraph with a vertex \(v\) forming a partite set has an \(n\)-pancyclic partial ordering from \(v\). This generalizes a result by the reviewer from 1993.