Add to ORKGIn this paper, we consider factorizations of complete graph K-v into cycles and 1-factors. We will focus on the existence of factorizations of K-v containing two nonisomorphic factors. We obtain all possible solutions for uniform factors involving m-cycles and 1-factors with a few possible exceptions when m is odd
AbstractIn this paper we use Tutte's f-factor theorem and the method of amalgamations to find necess...
A perfect 1 -factorisation of a graph G is a decomposition of G into edge disjoint 1 -factors such t...
A perfectly one-factorable (P1F) regular graph G is a graph admitting a partition of the edge-set in...
In this paper, we consider factorizations of complete graph $K_v$ into cycles and $1$--factors. We w...
In this paper, we consider uniformly resolvable decompositions of complete graph K-v( or K-v minus a...
The number of 1-factors (near 1-factors) that mu 1-factorizations (near 1-factorizations) of the com...
An automorphism group G of a 1-factorization of the complete multipartite graph K_m×n consists of pe...
It is shown that the complete graph Kn has a cyclic 1-factorization if and only if n is even and n≠2...
A generalization of the Oberwolfach problem, proposed by Liu (J Comb Des 8:42-49, 2000), asks for a ...
AbstractIn this note we give a necessary and sufficient condition for factorization of graphs satisf...
AbstractIt is known that the Horton starters can be used to construct uniform one-factorizations of ...
It is shown that if K is any regular complete multipartite graph of even degree, and F is any bipart...
AbstractThe following problem has arisen in the study of graphs, lattices and finite topologies. Is ...
We consider k-factorizations of the complete graph that are 1-rotational under an assigned group G, ...
We consider k-factorizations of the complete graph that are 1-rotational under an assigned group G, ...
AbstractIn this paper we use Tutte's f-factor theorem and the method of amalgamations to find necess...
A perfect 1 -factorisation of a graph G is a decomposition of G into edge disjoint 1 -factors such t...
A perfectly one-factorable (P1F) regular graph G is a graph admitting a partition of the edge-set in...
In this paper, we consider factorizations of complete graph $K_v$ into cycles and $1$--factors. We w...
In this paper, we consider uniformly resolvable decompositions of complete graph K-v( or K-v minus a...
The number of 1-factors (near 1-factors) that mu 1-factorizations (near 1-factorizations) of the com...
An automorphism group G of a 1-factorization of the complete multipartite graph K_m×n consists of pe...
It is shown that the complete graph Kn has a cyclic 1-factorization if and only if n is even and n≠2...
A generalization of the Oberwolfach problem, proposed by Liu (J Comb Des 8:42-49, 2000), asks for a ...
AbstractIn this note we give a necessary and sufficient condition for factorization of graphs satisf...
AbstractIt is known that the Horton starters can be used to construct uniform one-factorizations of ...
It is shown that if K is any regular complete multipartite graph of even degree, and F is any bipart...
AbstractThe following problem has arisen in the study of graphs, lattices and finite topologies. Is ...
We consider k-factorizations of the complete graph that are 1-rotational under an assigned group G, ...
We consider k-factorizations of the complete graph that are 1-rotational under an assigned group G, ...
AbstractIn this paper we use Tutte's f-factor theorem and the method of amalgamations to find necess...
A perfect 1 -factorisation of a graph G is a decomposition of G into edge disjoint 1 -factors such t...
A perfectly one-factorable (P1F) regular graph G is a graph admitting a partition of the edge-set in...