Abstract
The circulant graph 〈S〉 n , where S⊆Z n ∖{0}, has vertex set Z n and edge set {{x,x+s}|x ∈ Z n ,s ∈ S}. It is shown that there is a Hamilton cycle decomposition of every 6-regular circulant graph 〈S〉 n in which S has an element of order n.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Alspach, B.: Research problem 59. Discrete Math. 50, 115 (1984)
Bermond, J. C., Favaron, O., Maheo, M.: Hamiltonian decomposition of Cayley graphs of degree 4. J. Combin Theory Ser. B 46, 142–153 (1989)
Curran, S. J., Gallian, J. A.: Hamiltonian cycles and paths in Cayley graphs and digraphs - A survey. Discrete Math. 156, 1–18 (1996)
Fan, C., Lick, D., Liu, J.: Pseudo-cartesian products and hamiltonian decompositions of Cayley graphs on abelian groups. Discrete Math. 158, 49–62 (1996)
Liu, J.: Hamiltonian decompositions of Cayley graphs on Abelian groups. Discrete Math 131, 163–171 (1994)
Liu, J.: Hamiltonian decompositions of Cayley graphs on abelian groups of even order. J. Combin Theory Ser. B 88, 305–321 (2003)
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Dean, M. On Hamilton Cycle Decomposition of 6-regular Circulant Graphs. Graphs and Combinatorics 22, 331–340 (2006). https://doi.org/10.1007/s00373-006-0657-0
Received:
Accepted:
Issue Date:
DOI: https://doi.org/10.1007/s00373-006-0657-0