Hamiltonian cycles and paths in Cayley graphs and digraphs—a survey
Discrete Mathematics
Disjoint Hamiltonian cycles in recursive circulant graphs
Information Processing Letters
Directed Hamiltonian Packing in d-Dimensional Meshes and Its Application (Extended Abstract)
ISAAC '96 Proceedings of the 7th International Symposium on Algorithms and Computation
Graph Theory With Applications
Graph Theory With Applications
Embedding Full Ternary Trees into Recursive Circulants
EurAsia-ICT '02 Proceedings of the First EurAsian Conference on Information and Communication Technology
Dihamiltonian Decomposition of Regular Graphs with Degree Three
WG '99 Proceedings of the 25th International Workshop on Graph-Theoretic Concepts in Computer Science
Disjoint path covers in recursive circulants G(2m,4) with faulty elements
Theoretical Computer Science
| Hi-index | 0.00 |
We show that recursive circulant G(cdm, d) is hamiltonian decomposable. Recursive circulant is a graph proposed for an interconnection structure of multicomputer networks in [8]. The result is not only a partial answer to the problem posed by Alspach that every connected Cayley graph over an abelian group is hamiltonian decomposable, but also an extension of Micheneau's that recursive circulant G(2m, 4) is hamiltonian decomposable.