Hamilton cycle decomposition of 6-regular circulants of odd order

摘要

The circulant G = C(n,S), where s c z_N{o}, is the graph with vertex set Zn and edge set e(g) = {{X, X + X}|X ∈zpN, S ∈S. It is shown that for n odd, every 6-regular connected circulant C(n, S) is decomposable into Hamilton cycles.