Hamiltonian decomposition of Cayley graphs of degree 4 (Q1089003)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4002128
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Hamiltonian decomposition of Cayley graphs of degree 4 |
scientific article; zbMATH DE number 4002128 |
Statements
Hamiltonian decomposition of Cayley graphs of degree 4 (English)
0 references
1989
0 references
We prove that any 4-regular connected Cayley graph on a finite abelian group can be decomposed into two hamiltonian cycles. This answers a partial case of Alspach's conjecture concerning hamiltonian decompositions of 2k-regular connected Cayley graphs. As corollary we obtain the hamiltonian decomposition of 2-jump circulant graphs, called also double loops.
0 references
Cayley graph
0 references
hamiltonian cycles
0 references
hamiltonian decompositions
0 references
2-jump circulant graphs
0 references
double loops
0 references
0 references
0.9554833
0 references
0 references
0.92736244
0 references
0.92341924
0 references
0.9109611
0 references
