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
A Hamiltonian graph G = (V,E) is called hyper-Hamiltonian if G-v is Hamiltonian for any v ∈ V(G). G ...
AbstractCall a directed graph G↔ symmetric if it is obtained from an undirected graph G by replacing...
The circulant graph of order n with connection set S is denoted by Circ(n, S). Several results on de...
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 ...
The natural infinite analog of a (finite) Hamilton cycle is a two-way-infinite Hamilton path (connec...
The circulant G = C(n, S), where S subset of Z(n) {0}, is the graph with vertex set Z(n) and edge se...
Some bipartite Hamilton decomposable graphs that are regular of degree δ ≡ 2 (mod 4) are shown to ha...
AbstractLet G1 and G2 be graphs that are decomposable into Hamilton cycles. Bermond (1978), generali...
A Hamilton cycle in a directed graph G is a cycle that passes through every vertex of G. A Hamilton ...
[[abstract]]Let G be a graph. For a positive integer k, the k-th power Gk of G is the graph having t...
A Hamilton cycle is a cycle which passes through every vertex of a graph. A Hamilton cycle decomposi...
We will discuss the status of the search for hamiltonian cycles in circulant graphs and circulant di...
AbstractIt is well known that K2n + 1 can be decomposed into n edge-disjoint Hamilton cycles. A nove...
A recursive-circulant $G(n; d)$ is defined to be acirculant graph with $n$ vertices and jumps of pow...
We prove that a complete multipartite graph K with n>1 vertices and m edges can be decomposed into e...
A Hamiltonian graph G = (V,E) is called hyper-Hamiltonian if G-v is Hamiltonian for any v ∈ V(G). G ...
AbstractCall a directed graph G↔ symmetric if it is obtained from an undirected graph G by replacing...
The circulant graph of order n with connection set S is denoted by Circ(n, S). Several results on de...
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 ...
The natural infinite analog of a (finite) Hamilton cycle is a two-way-infinite Hamilton path (connec...
The circulant G = C(n, S), where S subset of Z(n) {0}, is the graph with vertex set Z(n) and edge se...
Some bipartite Hamilton decomposable graphs that are regular of degree δ ≡ 2 (mod 4) are shown to ha...
AbstractLet G1 and G2 be graphs that are decomposable into Hamilton cycles. Bermond (1978), generali...
A Hamilton cycle in a directed graph G is a cycle that passes through every vertex of G. A Hamilton ...
[[abstract]]Let G be a graph. For a positive integer k, the k-th power Gk of G is the graph having t...
A Hamilton cycle is a cycle which passes through every vertex of a graph. A Hamilton cycle decomposi...
We will discuss the status of the search for hamiltonian cycles in circulant graphs and circulant di...
AbstractIt is well known that K2n + 1 can be decomposed into n edge-disjoint Hamilton cycles. A nove...
A recursive-circulant $G(n; d)$ is defined to be acirculant graph with $n$ vertices and jumps of pow...
We prove that a complete multipartite graph K with n>1 vertices and m edges can be decomposed into e...
A Hamiltonian graph G = (V,E) is called hyper-Hamiltonian if G-v is Hamiltonian for any v ∈ V(G). G ...
AbstractCall a directed graph G↔ symmetric if it is obtained from an undirected graph G by replacing...
The circulant graph of order n with connection set S is denoted by Circ(n, S). Several results on de...
DOI
Add to ORKG