Alspach has conjectured that any 2k-regular connected Cayley graph cay(A,S) on a finite abelian group A can be decomposed into k hamiltonian cycles. In this paper, the conjecture is shown to be true if S= {sl,sz, s3} is a minimal generating set of A with 1 Al odd, or S={sl,s& . . . . sk} is a genera
A note on Hamiltonian decompositions of Cayley graphs
โ Scribed by U. Baumann; M. Lesch; I. Schmeichel
- Book ID
- 112951177
- Publisher
- Vandenhoeck & Ruprecht
- Year
- 1995
- Tongue
- German
- Weight
- 231 KB
- Volume
- 65
- Category
- Article
- ISSN
- 0025-5858
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
Alspach has conjectured that any 2k-regular connected Cayley graph cay(A, S) on a finite abelian group A can be decomposed into k hamiltonian cycles. In this paper, the conjecture is shown to be true if S=[s 1 , s 2 , ..., s k ] is a minimal generating set of an abelian group A of odd order (where a
Alspach has conjectured that any 2k-regular connected Cayley graph cay(A,S) on a finite abelian group A can be decomposed into k hamiltonian cycles. In this paper we generalize a result by Kotzig that the Cartesian product of any two cycles can be decomposed into two hamiltonian cycles and show that