AbstractWe show that for any 2-factor U of Kn with n even, there exists a 3-factor T of Kn such that E(U)⊂E(T) such that Kn−E(T) admits a hamilton decomposition. This is proved with the method of amalgamations (graph homomorphisms), using a new result that concerns graph decompositions that are fairly divided, but not necessarily regular
AbstractA graph is said to be decomposable into hamiltonian cycles if its edge set can be partitione...
AbstractLet K2t+1,2t+1−I denote the complete bipartite graph K2t+1,2t+1 minus a 1-factor. In this pa...
AbstractLet K(n;r) denote the complete r-partite graph K(n, n,…, n). It is shown here that for all e...
AbstractWe show that for any 2-factor U of Kn with n even, there exists a 3-factor T of Kn such that...
AbstractA fair hamilton decomposition of the complete multipartite graph G is a set of hamilton cycl...
AbstractIn this paper we give a procedure by which Hamiltonian decompositions of the s-partite graph...
The Hamilton–Waterloo problem asks for which s and r the complete graph Kn can be decomposed into s ...
Abstract. In a sequence of four papers, we prove the following results (via a unified approach) for ...
A decomposition of a graph is a set of subgraphs whose edges partition those of $G$. The 3-decomposi...
Let k, m, n, λ, and μ be positive integers. A decomposition of math formula into edge-disjoint subgr...
In this paper we prove the following results (via a unified approach) for all sufficiently large n: ...
AbstractA finite graph F is a detachment of a finite graph G if G can be obtained from F by partitio...
In this paper we prove the following results (via a unified approach) for all sufficiently large n: ...
For all integers n greater than or equal to 5, it is shown that the graph obtained from the n-cycle ...
AbstractLet t be a positive integer, and let L=(l1,…,lt) and K=(k1,…,kt) be collections of nonnegati...
AbstractA graph is said to be decomposable into hamiltonian cycles if its edge set can be partitione...
AbstractLet K2t+1,2t+1−I denote the complete bipartite graph K2t+1,2t+1 minus a 1-factor. In this pa...
AbstractLet K(n;r) denote the complete r-partite graph K(n, n,…, n). It is shown here that for all e...
AbstractWe show that for any 2-factor U of Kn with n even, there exists a 3-factor T of Kn such that...
AbstractA fair hamilton decomposition of the complete multipartite graph G is a set of hamilton cycl...
AbstractIn this paper we give a procedure by which Hamiltonian decompositions of the s-partite graph...
The Hamilton–Waterloo problem asks for which s and r the complete graph Kn can be decomposed into s ...
Abstract. In a sequence of four papers, we prove the following results (via a unified approach) for ...
A decomposition of a graph is a set of subgraphs whose edges partition those of $G$. The 3-decomposi...
Let k, m, n, λ, and μ be positive integers. A decomposition of math formula into edge-disjoint subgr...
In this paper we prove the following results (via a unified approach) for all sufficiently large n: ...
AbstractA finite graph F is a detachment of a finite graph G if G can be obtained from F by partitio...
In this paper we prove the following results (via a unified approach) for all sufficiently large n: ...
For all integers n greater than or equal to 5, it is shown that the graph obtained from the n-cycle ...
AbstractLet t be a positive integer, and let L=(l1,…,lt) and K=(k1,…,kt) be collections of nonnegati...
AbstractA graph is said to be decomposable into hamiltonian cycles if its edge set can be partitione...
AbstractLet K2t+1,2t+1−I denote the complete bipartite graph K2t+1,2t+1 minus a 1-factor. In this pa...
AbstractLet K(n;r) denote the complete r-partite graph K(n, n,…, n). It is shown here that for all e...
DOI
Add to ORKG