AbstractWe prove that there exists an almost resolvable m-cycle decomposition of 2Kms+1 for all odd m⩾3 and all s⩾1
AbstractWe establish necessary and sufficient conditions for decomposing the complete graph of even ...
AbstractTwo theorems are proved in this paper. Firstly, it is proved that there exists a decompositi...
AbstractIn this paper we show that the complete equipartite graph with n parts, each of size 2k, dec...
AbstractWe prove that there exists an almost resolvable m-cycle decomposition of 2Kms+1 for all odd ...
AbstractLet m ⩾ 3 be an odd integer. In this paper it is shown that if n ⩾ m is odd and m divides n,...
AbstractIn this paper we solve a uniform length cycle version of the Oberwolfach problem for multigr...
AbstractFor m,n even and n>m, the obvious necessary conditions for the existence of a decomposition ...
AbstractWe show that if Kn−I, the complete graph on n vertices with a 1-factor removed, can be decom...
AbstractIn this paper we give necessary and sufficient conditions in order that Km,n (Km,n∗) admits ...
AbstractLet m1,m2,…,mk be positive integers not less than 3 and let n=∑i=1kmi. Then, it is proved th...
AbstractLet m1,m2,…,mt be a list of integers. It is shown that there exists an integer N such that f...
Diamond open accessIn this paper, we provide necessary and sufficient conditions for the existence of ...
AbstractWe show how to obtain maximum packings of K2kg+v with k-cycles when k⩾3 is odd, g a positive...
We show that the complete graph on n vertices can be decomposed into t cycles of specified lengths m...
For m, n even and n > m, the obvious necessary conditions for the existence of a decomposition of...
AbstractWe establish necessary and sufficient conditions for decomposing the complete graph of even ...
AbstractTwo theorems are proved in this paper. Firstly, it is proved that there exists a decompositi...
AbstractIn this paper we show that the complete equipartite graph with n parts, each of size 2k, dec...
AbstractWe prove that there exists an almost resolvable m-cycle decomposition of 2Kms+1 for all odd ...
AbstractLet m ⩾ 3 be an odd integer. In this paper it is shown that if n ⩾ m is odd and m divides n,...
AbstractIn this paper we solve a uniform length cycle version of the Oberwolfach problem for multigr...
AbstractFor m,n even and n>m, the obvious necessary conditions for the existence of a decomposition ...
AbstractWe show that if Kn−I, the complete graph on n vertices with a 1-factor removed, can be decom...
AbstractIn this paper we give necessary and sufficient conditions in order that Km,n (Km,n∗) admits ...
AbstractLet m1,m2,…,mk be positive integers not less than 3 and let n=∑i=1kmi. Then, it is proved th...
AbstractLet m1,m2,…,mt be a list of integers. It is shown that there exists an integer N such that f...
Diamond open accessIn this paper, we provide necessary and sufficient conditions for the existence of ...
AbstractWe show how to obtain maximum packings of K2kg+v with k-cycles when k⩾3 is odd, g a positive...
We show that the complete graph on n vertices can be decomposed into t cycles of specified lengths m...
For m, n even and n > m, the obvious necessary conditions for the existence of a decomposition of...
AbstractWe establish necessary and sufficient conditions for decomposing the complete graph of even ...
AbstractTwo theorems are proved in this paper. Firstly, it is proved that there exists a decompositi...
AbstractIn this paper we show that the complete equipartite graph with n parts, each of size 2k, dec...
DOI
Add to ORKG