6-regular Cayley graphs on abelian groups of odd order are hamiltonian decomposable
Document Type
Article
Publication Date
8-28-2009
Abstract
Alspach conjectured that any 2 k-regular connected Cayley graph on a finite abelian group A has a hamiltonian decomposition. In this paper, the conjecture is shown true if k = 3, and the order of A is odd. © 2009 Elsevier B.V. All rights reserved.
Publication Title
Discrete Mathematics
Recommended Citation
Westlund, E.,
Liu, J.,
&
Kreher, D.
(2009).
6-regular Cayley graphs on abelian groups of odd order are hamiltonian decomposable.
Discrete Mathematics,
309(16), 5106-5110.
http://doi.org/10.1016/j.disc.2009.03.043
Retrieved from: https://digitalcommons.mtu.edu/michigantech-p/6284
COinS