AbstractLet K2t+1,2t+1−I denote the complete bipartite graph K2t+1,2t+1 minus a 1-factor. In this paper, we prove that there exist a large set of Hamilton cycle decomposition of K2t,2t and a large set of Hamilton cycle decomposition of K2t+1,2t+1−I
Abstract. In a sequence of four papers, we prove the following results (via a unified approach) for ...
[[abstract]]In this paper we show the sufficient conditions for the decomposition of the complete bi...
In this paper we prove the following results (via a unified approach) for all sufficiently large n: ...
AbstractLet K2t+1,2t+1−I denote the complete bipartite graph K2t+1,2t+1 minus a 1-factor. In this pa...
AbstractIn this paper, it is shown that the tensor product of the complete bipartite graph, Kr,r,r≥2...
For all integers n greater than or equal to 5, it is shown that the graph obtained from the n-cycle ...
AbstractIn this paper it is proved that if a graph G has a decomposition into an even (resp., odd) n...
The Hamilton–Waterloo problem asks for which s and r the complete graph Kn can be decomposed into s ...
A Hamilton cycle in a directed graph G is a cycle that passes through every vertex of G. A Hamilton ...
AbstractIt is well known that K2n + 1 can be decomposed into n edge-disjoint Hamilton cycles. A nove...
A necessary and sufficient condition is obtained for a bipartite graph to have an f-factor which inc...
AbstractA set S of edge-disjoint hamilton cycles in a graph T is said to be maximal if the hamilton ...
Abstract. In a sequence of four papers, we prove the following results (via a unified approach) for ...
Let n ≥ 3 and ⋋ ≥ 1 be integers. Let ⋋Kn denote the complete multigraph with edge-multiplicity ⋋. In...
This paper surveys results on cycle decompositions of complete multipartite graphs (where the parts ...
Abstract. In a sequence of four papers, we prove the following results (via a unified approach) for ...
[[abstract]]In this paper we show the sufficient conditions for the decomposition of the complete bi...
In this paper we prove the following results (via a unified approach) for all sufficiently large n: ...
AbstractLet K2t+1,2t+1−I denote the complete bipartite graph K2t+1,2t+1 minus a 1-factor. In this pa...
AbstractIn this paper, it is shown that the tensor product of the complete bipartite graph, Kr,r,r≥2...
For all integers n greater than or equal to 5, it is shown that the graph obtained from the n-cycle ...
AbstractIn this paper it is proved that if a graph G has a decomposition into an even (resp., odd) n...
The Hamilton–Waterloo problem asks for which s and r the complete graph Kn can be decomposed into s ...
A Hamilton cycle in a directed graph G is a cycle that passes through every vertex of G. A Hamilton ...
AbstractIt is well known that K2n + 1 can be decomposed into n edge-disjoint Hamilton cycles. A nove...
A necessary and sufficient condition is obtained for a bipartite graph to have an f-factor which inc...
AbstractA set S of edge-disjoint hamilton cycles in a graph T is said to be maximal if the hamilton ...
Abstract. In a sequence of four papers, we prove the following results (via a unified approach) for ...
Let n ≥ 3 and ⋋ ≥ 1 be integers. Let ⋋Kn denote the complete multigraph with edge-multiplicity ⋋. In...
This paper surveys results on cycle decompositions of complete multipartite graphs (where the parts ...
Abstract. In a sequence of four papers, we prove the following results (via a unified approach) for ...
[[abstract]]In this paper we show the sufficient conditions for the decomposition of the complete bi...
In this paper we prove the following results (via a unified approach) for all sufficiently large n: ...
DOI
Add to ORKG