AbstractStarting from earliest papers by Rosa we solve, directly and explicitly, the existence problem for cyclic k-cycle systems of the complete graph Kv with v≡1(mod2k), and the existence problem for cyclic k-cycle systems of the complete m-partite graph Km×k with m and k being odd. As a particular consequence, a cyclic p-cycle system of Kv with p being a prime exists for all admissible values of v but (p,v)≠(3,9). This was previously known only for p=3,5,7
AbstractLet Kn,n−I denote the complete bipartite graph with n vertices in each part from which a 1-f...
We present some necessary and/or sufficient conditions for the existence of an elementary abelian c...
We explicitly solve the existence problem for 1-rotational k-cycle systems of the complete graph $K_...
AbstractStarting from earliest papers by Rosa we solve, directly and explicitly, the existence probl...
Starting from earliest papers by Rosa we solve, directly and explicitly, the existence problem for c...
AbstractWe present direct and recursive constructions for some classes of cyclic i-perfect k-cycle s...
AbstractIn this paper, we prove that cyclic hamiltonian cycle systems of the complete graph minus a ...
AbstractWe prove that there exists a cyclic Hamiltonian k-cycle system of the complete graph if and ...
AbstractIn this paper we completely settle the embedding problem for m-cycle systems with m ⩽ 14. We...
Diamond open accessIn this paper, we provide necessary and sufficient conditions for the existence of ...
In this paper, we study the existence problem for cyclic ℓ-cycle decompositions of the graph Km[n], ...
AbstractLet m1,m2,…,mk be positive integers not less than 3 and let n=∑i=1kmi. Then, it is proved th...
AbstractWe establish the necessary and sufficient conditions for the existence of a cyclic Hamiltoni...
Cyclic m-cycle systems of order v are constructed for all m greater than or equal to 3, and all v = ...
We prove that there exists a cyclic Hamiltonian k-cycle system of the complete graph if and only if ...
AbstractLet Kn,n−I denote the complete bipartite graph with n vertices in each part from which a 1-f...
We present some necessary and/or sufficient conditions for the existence of an elementary abelian c...
We explicitly solve the existence problem for 1-rotational k-cycle systems of the complete graph $K_...
AbstractStarting from earliest papers by Rosa we solve, directly and explicitly, the existence probl...
Starting from earliest papers by Rosa we solve, directly and explicitly, the existence problem for c...
AbstractWe present direct and recursive constructions for some classes of cyclic i-perfect k-cycle s...
AbstractIn this paper, we prove that cyclic hamiltonian cycle systems of the complete graph minus a ...
AbstractWe prove that there exists a cyclic Hamiltonian k-cycle system of the complete graph if and ...
AbstractIn this paper we completely settle the embedding problem for m-cycle systems with m ⩽ 14. We...
Diamond open accessIn this paper, we provide necessary and sufficient conditions for the existence of ...
In this paper, we study the existence problem for cyclic ℓ-cycle decompositions of the graph Km[n], ...
AbstractLet m1,m2,…,mk be positive integers not less than 3 and let n=∑i=1kmi. Then, it is proved th...
AbstractWe establish the necessary and sufficient conditions for the existence of a cyclic Hamiltoni...
Cyclic m-cycle systems of order v are constructed for all m greater than or equal to 3, and all v = ...
We prove that there exists a cyclic Hamiltonian k-cycle system of the complete graph if and only if ...
AbstractLet Kn,n−I denote the complete bipartite graph with n vertices in each part from which a 1-f...
We present some necessary and/or sufficient conditions for the existence of an elementary abelian c...
We explicitly solve the existence problem for 1-rotational k-cycle systems of the complete graph $K_...