Cycles of all lengths in arc-3-cyclic semicomplete digraphs (Q1367024): Difference between revisions

A digraph of order \(n\) is said to be arc-\(k\)-cyclic if every arc lies in a directed cycle of length \(k\). It is said to be arc-pancyclic if it is arc-\(k\)-cyclic for each \(k\in\{3,4,\ldots,n\}\). A digraph \(D\) is said to be a semicomplete digraph if for every pair of distinct vertices \(u\) and \(v\) in \(D\), at least one of \((u,v)\) or \((v,u)\) is an arc of \(D\). The authors study arc-\(k\)-cyclicity and arc-pancyclicity of semicomplete digraphs.