AbstractCall a directed graph G↔ symmetric if it is obtained from an undirected graph G by replacing each edge of G by two directed edges, one in each direction. We will show that if G has a Hamilton decomposition with certain additional structure, then G↔×C↔n×K↔2 has a directed Hamilton decomposition. In particular, it will follow that the bidirected cubes Q↔2m+1 for m⩾2 are decomposable into 2m+1 directed Hamilton cycles and that a product of cycles C↔n1×⋯×C↔nm×K↔2 is decomposable into 2m+1 directed Hamilton cycles if ni⩾3 and m⩾2
AbstractLet G be a connected graph on n vertices, and let α, β, γ and δ be edge-disjoint cycles in G...
Some bipartite Hamilton decomposable graphs that are regular of degree δ ≡ 2 (mod 4) are shown to ha...
AbstractIn this paper we prove that the complete symmetric directed graph with n vertices K∗n can be...
AbstractCall a directed graph G↔ symmetric if it is obtained from an undirected graph G by replacing...
AbstractLet G1 and G2 be graphs that are decomposable into Hamilton cycles. Bermond (1978), generali...
AbstractA graph is said to be decomposable into hamiltonian cycles if its edge set can be partitione...
A Hamilton cycle in a directed graph G is a cycle that passes through every vertex of G. A Hamilton ...
AbstractIn this article we prove a conjecture of Bermond, Darrot, Delmas, and Perennes by constructi...
AbstractThe graph G(N,d) has vertex set V={0,1,…,N−1}, with {v,w} an edge if v−w≡±di(modN) for some ...
AbstractLet G be a cubic graph of order 2n consisting of a cycle plus a perfect matching and let G∗ ...
AbstractWe survey some recent results on long-standing conjectures regarding Hamilton cycles in dire...
AbstractWe prove that the complete regular multipartite digraph Kr;s∗ is decomposable into directed ...
AbstractIt is shown that K2m∗, 2m ≥ 8, can be decomposed into Hamiltonian circuits. A direct constru...
AbstractIn this paper we prove the conjecture of J.-C. Bermond (Ann. Discrete Math. 36 (1978), 21–28...
AbstractIn this paper, it is shown that the tensor product of the complete bipartite graph, Kr,r,r≥2...
AbstractLet G be a connected graph on n vertices, and let α, β, γ and δ be edge-disjoint cycles in G...
Some bipartite Hamilton decomposable graphs that are regular of degree δ ≡ 2 (mod 4) are shown to ha...
AbstractIn this paper we prove that the complete symmetric directed graph with n vertices K∗n can be...
AbstractCall a directed graph G↔ symmetric if it is obtained from an undirected graph G by replacing...
AbstractLet G1 and G2 be graphs that are decomposable into Hamilton cycles. Bermond (1978), generali...
AbstractA graph is said to be decomposable into hamiltonian cycles if its edge set can be partitione...
A Hamilton cycle in a directed graph G is a cycle that passes through every vertex of G. A Hamilton ...
AbstractIn this article we prove a conjecture of Bermond, Darrot, Delmas, and Perennes by constructi...
AbstractThe graph G(N,d) has vertex set V={0,1,…,N−1}, with {v,w} an edge if v−w≡±di(modN) for some ...
AbstractLet G be a cubic graph of order 2n consisting of a cycle plus a perfect matching and let G∗ ...
AbstractWe survey some recent results on long-standing conjectures regarding Hamilton cycles in dire...
AbstractWe prove that the complete regular multipartite digraph Kr;s∗ is decomposable into directed ...
AbstractIt is shown that K2m∗, 2m ≥ 8, can be decomposed into Hamiltonian circuits. A direct constru...
AbstractIn this paper we prove the conjecture of J.-C. Bermond (Ann. Discrete Math. 36 (1978), 21–28...
AbstractIn this paper, it is shown that the tensor product of the complete bipartite graph, Kr,r,r≥2...
AbstractLet G be a connected graph on n vertices, and let α, β, γ and δ be edge-disjoint cycles in G...
Some bipartite Hamilton decomposable graphs that are regular of degree δ ≡ 2 (mod 4) are shown to ha...
AbstractIn this paper we prove that the complete symmetric directed graph with n vertices K∗n can be...