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 0⩽i⩽⌈logdN⌉−1. We show that the circulant graph G(cdm,d) is Hamilton decomposable for all positive integers c,d, and m with c<d. This extends work of Micheneau and answers a special case of a question of Alspach
The natural infinite analog of a (finite) Hamilton cycle is a two-way-infinite Hamilton path (connec...
In this paper we prove that if G is a (k + 2)-connected graph on n > 3 vertices satisfying P(n + ...
AbstractD. Bauer, H. J. Broersma, R. Li, and H. J. Veldman proved that ifGis a 2-connected graph wit...
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 ...
AbstractWe prove that the complete regular multipartite digraph Kr;s∗ is decomposable into directed ...
AbstractCall a directed graph G↔ symmetric if it is obtained from an undirected graph G by replacing...
AbstractA graph is said to be decomposable into hamiltonian cycles if its edge set can be partitione...
For given positive integer n ≥ 4, let Cn, Kn and L(Kn) respectively denote a cycle with n edges, a c...
AbstractWe survey some recent results on long-standing conjectures regarding Hamilton cycles in dire...
AbstractLet G be a digraph that consists of a finite set of vertices V(G). G is called a circulant d...
AbstractWe prove that any 4-regular connected Cayley graph on a finite abelian group can be decompos...
AbstractIt is shown that K2m∗, 2m ≥ 8, can be decomposed into Hamiltonian circuits. A direct constru...
A Hamilton cycle is a cycle which passes through every vertex of a graph. A Hamilton cycle decomposi...
AbstractLet G1 and G2 be graphs that are decomposable into Hamilton cycles. Bermond (1978), generali...
AbstractIn this article we prove a conjecture of Bermond, Darrot, Delmas, and Perennes by constructi...
The natural infinite analog of a (finite) Hamilton cycle is a two-way-infinite Hamilton path (connec...
In this paper we prove that if G is a (k + 2)-connected graph on n > 3 vertices satisfying P(n + ...
AbstractD. Bauer, H. J. Broersma, R. Li, and H. J. Veldman proved that ifGis a 2-connected graph wit...
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 ...
AbstractWe prove that the complete regular multipartite digraph Kr;s∗ is decomposable into directed ...
AbstractCall a directed graph G↔ symmetric if it is obtained from an undirected graph G by replacing...
AbstractA graph is said to be decomposable into hamiltonian cycles if its edge set can be partitione...
For given positive integer n ≥ 4, let Cn, Kn and L(Kn) respectively denote a cycle with n edges, a c...
AbstractWe survey some recent results on long-standing conjectures regarding Hamilton cycles in dire...
AbstractLet G be a digraph that consists of a finite set of vertices V(G). G is called a circulant d...
AbstractWe prove that any 4-regular connected Cayley graph on a finite abelian group can be decompos...
AbstractIt is shown that K2m∗, 2m ≥ 8, can be decomposed into Hamiltonian circuits. A direct constru...
A Hamilton cycle is a cycle which passes through every vertex of a graph. A Hamilton cycle decomposi...
AbstractLet G1 and G2 be graphs that are decomposable into Hamilton cycles. Bermond (1978), generali...
AbstractIn this article we prove a conjecture of Bermond, Darrot, Delmas, and Perennes by constructi...
The natural infinite analog of a (finite) Hamilton cycle is a two-way-infinite Hamilton path (connec...
In this paper we prove that if G is a (k + 2)-connected graph on n > 3 vertices satisfying P(n + ...
AbstractD. Bauer, H. J. Broersma, R. Li, and H. J. Veldman proved that ifGis a 2-connected graph wit...
DOI
Add to ORKG