AbstractLet e1,e2,…,en be a sequence of nonnegative integers such that the first non-zero term is not one. Let ∑i=1nei=(q−1)/2, where q=pn and p is an odd prime. We prove that the complete graph on q vertices can be decomposed into e1Cpn-factors, e2Cpn−1-factors, …, and enCp-factors
Let n >= 3 and let F be a 2-regular graph of order n. The Oberwolfach problem OP(F) asks for a 2-fac...
AbstractIn this paper we prove that if (r,12)⩽3, then the set of positive odd integers k such that k...
AbstractIt is shown that the necessary conditions mn ≡ 0 (mod k) and (m − 1)nk ≡ 0 (mod 2(k − 1)) fo...
AbstractLet e1,e2,…,en be a sequence of nonnegative integers such that the first non-zero term is no...
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...
AbstractLet n⩾3 and let F be a 2-regular graph of order n. The Oberwolfach problem OP(F) asks for a ...
The generalized Oberwolfach problem asks for a decomposition of a graph $G$ into specified 2-regular...
AbstractLet F be a 2-regular graph. We prove that the complete bipartite graph Kn,n can be decompose...
Various results on factorisations of complete graphs into circulant graphs and on 2-factorisations o...
In this paper, we consider factorizations of complete graph $K_v$ into cycles and $1$--factors. We w...
It is shown that if F-1, F-2, ... , F-t are bipartite 2-regular graphs of order n and alpha(1), alph...
A method to construct simple graphs starting from known ones is introduced. This method can be appl...
A method to construct simple graphs starting from known ones is introduced. This method can be appl...
AbstractLet m ⩾ 3 be an odd integer. In this paper it is shown that if n ⩾ m is odd and m divides n,...
Let n >= 3 and let F be a 2-regular graph of order n. The Oberwolfach problem OP(F) asks for a 2-fac...
AbstractIn this paper we prove that if (r,12)⩽3, then the set of positive odd integers k such that k...
AbstractIt is shown that the necessary conditions mn ≡ 0 (mod k) and (m − 1)nk ≡ 0 (mod 2(k − 1)) fo...
AbstractLet e1,e2,…,en be a sequence of nonnegative integers such that the first non-zero term is no...
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...
AbstractLet n⩾3 and let F be a 2-regular graph of order n. The Oberwolfach problem OP(F) asks for a ...
The generalized Oberwolfach problem asks for a decomposition of a graph $G$ into specified 2-regular...
AbstractLet F be a 2-regular graph. We prove that the complete bipartite graph Kn,n can be decompose...
Various results on factorisations of complete graphs into circulant graphs and on 2-factorisations o...
In this paper, we consider factorizations of complete graph $K_v$ into cycles and $1$--factors. We w...
It is shown that if F-1, F-2, ... , F-t are bipartite 2-regular graphs of order n and alpha(1), alph...
A method to construct simple graphs starting from known ones is introduced. This method can be appl...
A method to construct simple graphs starting from known ones is introduced. This method can be appl...
AbstractLet m ⩾ 3 be an odd integer. In this paper it is shown that if n ⩾ m is odd and m divides n,...
Let n >= 3 and let F be a 2-regular graph of order n. The Oberwolfach problem OP(F) asks for a 2-fac...
AbstractIn this paper we prove that if (r,12)⩽3, then the set of positive odd integers k such that k...
AbstractIt is shown that the necessary conditions mn ≡ 0 (mod k) and (m − 1)nk ≡ 0 (mod 2(k − 1)) fo...
DOI
Add to ORKG