Cyclic Partition of Strong Tournaments
Jinlong Shu, Hao Li · 2004
Let T be a strong tournament with n vertices. In this paper, by using a characterization of strong tournaments which can not be vertex partitioned, we show that if T is a strong n-tournament with max{δ(superscript +), δ(superscript -)}≥5k-5 and k≥2, then T can be partitioned into k cycles.