On \(k\)-strong and \(k\)-cyclic digraphs (Q1356647)

A digraph \(D\) is \(k\)-cyclic if for every set \(X\) of \(k\) vertices of \(D\) there exists a cycle of \(D\) containing all the vertices of \(X\). The authors prove that for every natural number \(k\) every \(k\)-strong digraph from a specified family of digraphs is \(k\)-cyclic.