All 2-connected in-tournaments that are cycle complementary (Q2483393)

An in-tournament is an oriented graph \(D\) such that for each vertex \(v\) of \(D\) the vertices that dominate \(D\) induce a tournament. The authors show that a 2-connected in-tournament \(T\) with at least 8 vertices contains two disjoint cycles that span the vertices of \(D\) unless \(D\) is 2-regular and has odd order.