Abstract.
We explicitly solve the existence problem for 1-rotational k-cycle systems of the complete graph K v with v≡1 or k (mod 2k). For v≡1 (mod 2k) we have existence if and only if k is an odd composite number. For any odd k and v≡k (mod 2k), (except k≡3 and v≡15, 21 (mod 24)) a 1-rotational k-cycle system of K v exists.
Similar content being viewed by others
Author information
Authors and Affiliations
Corresponding author
Additional information
Final version received: June 18, 2003
Rights and permissions
About this article
Cite this article
Buratti, M. Existence of 1-Rotational k-Cycle Systems of the Complete Graph. Graphs and Combinatorics 20, 41–46 (2004). https://doi.org/10.1007/s00373-003-0547-7
Received:
Issue Date:
DOI: https://doi.org/10.1007/s00373-003-0547-7