Almost resolvable decompositions of 2Kn into cycles of odd length
- Heinrich, Katherine
- Lindner, C.C
- Rodger, C.A
DOIAbstract
AbstractWe prove that there exists an almost resolvable m-cycle decomposition of 2Kms+1 for all odd m⩾3 and all s⩾1
AbstractWe prove that there exists an almost resolvable m-cycle decomposition of 2Kms+1 for all odd m⩾3 and all s⩾1
AbstractLet Kn,n−I denote the complete bipartite graph with n vertices in each part from which a 1-f...
AbstractLet m1,m2,…,mk be positive integers not less than 3 and let n=∑i=1kmi. Then, it is proved th...
AbstractIt has been previously shown by Bryant and Lindner that the only values of m for which 2-per...
AbstractWe prove that there exists an almost resolvable m-cycle decomposition of 2Kms+1 for all odd ...
AbstractFor m,n even and n>m, the obvious necessary conditions for the existence of a decomposition ...
For m, n even and n > m, the obvious necessary conditions for the existence of a decomposition of...
AbstractWe show that if Kn−I, the complete graph on n vertices with a 1-factor removed, can be decom...
AbstractLet m ⩾ 3 be an odd integer. In this paper it is shown that if n ⩾ m is odd and m divides n,...
AbstractWe prove that if m is odd then a partial m-cycle system on n vertices can be embedded in an ...
AbstractIn this paper we give necessary and sufficient conditions in order that Km,n (Km,n∗) admits ...
AbstractLet G be a 2-connected graph in which the degree of every vertex is at least d. We prove tha...
AbstractTechniques of labeling the vertices of a bipartite graph G with n edges to yield cyclic G-de...
AbstractIn this paper, we consider resolvable k-cycle decompositions (for short, k-RCD) of Km×Kn, wh...
We show that the complete graph on n vertices can be decomposed into t cycles of specified lengths m...
AbstractLet m1,m2,…,mt be a list of integers. It is shown that there exists an integer N such that f...
AbstractLet Kn,n−I denote the complete bipartite graph with n vertices in each part from which a 1-f...
AbstractLet m1,m2,…,mk be positive integers not less than 3 and let n=∑i=1kmi. Then, it is proved th...
AbstractIt has been previously shown by Bryant and Lindner that the only values of m for which 2-per...
AbstractWe prove that there exists an almost resolvable m-cycle decomposition of 2Kms+1 for all odd ...
AbstractFor m,n even and n>m, the obvious necessary conditions for the existence of a decomposition ...
For m, n even and n > m, the obvious necessary conditions for the existence of a decomposition of...
AbstractWe show that if Kn−I, the complete graph on n vertices with a 1-factor removed, can be decom...
AbstractLet m ⩾ 3 be an odd integer. In this paper it is shown that if n ⩾ m is odd and m divides n,...
AbstractWe prove that if m is odd then a partial m-cycle system on n vertices can be embedded in an ...
AbstractIn this paper we give necessary and sufficient conditions in order that Km,n (Km,n∗) admits ...
AbstractLet G be a 2-connected graph in which the degree of every vertex is at least d. We prove tha...
AbstractTechniques of labeling the vertices of a bipartite graph G with n edges to yield cyclic G-de...
AbstractIn this paper, we consider resolvable k-cycle decompositions (for short, k-RCD) of Km×Kn, wh...
We show that the complete graph on n vertices can be decomposed into t cycles of specified lengths m...
AbstractLet m1,m2,…,mt be a list of integers. It is shown that there exists an integer N such that f...
AbstractLet Kn,n−I denote the complete bipartite graph with n vertices in each part from which a 1-f...
AbstractLet m1,m2,…,mk be positive integers not less than 3 and let n=∑i=1kmi. Then, it is proved th...
AbstractIt has been previously shown by Bryant and Lindner that the only values of m for which 2-per...
Add to ORKG