Cycle factors in strongly connected local tournaments

A digraph without loops, multiple arcs and directed cycles of length two is called a local tournament if the set of in-neighbors as well as the set of out-neighbors of every vertex induces a tournament. A digraph is 2 -connected if the removal of an arbitrary vertex results in a strongly connected digraph. 4 and 2005, Li and Shu investigated the structure of strongly connected, but not 2 -connected tournaments. Using their structural results they were able to give sufficient conditions for a strongly connected tournament T to have complementary cycles or a k -cycle factor, i.e. a set of k vertex disjoint cycles that span the vertex set of T . ed by the articles of Li and Shu we develop in this paper the structure necessary for a strongly connected local tournament to be not cycle complementary. Using this structure, we are able to generalize and transfer various results of Li and Shu to the class of local tournaments.