๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

On Hamiltonian Decompositions of Cayley Graphs on Cyclic Groups

โœ Scribed by YIXIU HUANG


Book ID
119862773
Publisher
John Wiley and Sons
Year
1989
Tongue
English
Weight
234 KB
Volume
576
Category
Article
ISSN
0890-6564

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


Hamiltonian decompositions of Cayley gra
โœ Jiuqiang Liu ๐Ÿ“‚ Article ๐Ÿ“… 1994 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 606 KB

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

Hamiltonian Decompositions of Cayley Gra
โœ Jiuqiang Liu ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 380 KB

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

Pseudo-cartesian product and hamiltonian
โœ Cong Fan; Don R. Lick; Jiuqiang Liu ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 971 KB

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

Hamilton-Connected Cayley Graphs on Hami
โœ Brian Alspach; Yusheng Qin ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 109 KB

It is proven that every connected Cayley graph X , of valency at least three, on a Hamiltonian group is either Hamilton laceable when X is bipartite, or Hamilton connected when X is not bipartite.

On edge-hamiltonian Cayley graphs
โœ Ulrike Baumann ๐Ÿ“‚ Article ๐Ÿ“… 1994 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 667 KB