The out-arc 5-pancyclic vertices in strong tournaments
Qiaoping Guo, Meng Wei · Australas. J Comb. · 2013
An arc in a tournament T with n ≥ 3 vertices is called k-pancyclic, if it belongs to a cycle of length l for all k ≤ l ≤ n. In this paper, the result that each s-strong (s ≥ 3) tournament T contains at least s +2 out-arc 5-pancyclic vertices is obtained. Furthermore, our proof yields a polynomial algorithm to find s + 2 out-arc 5-pancyclic vertices of T.