✦ LIBER ✦

On Hamiltonian cycles in Cayley graphs of wreath products

✍ Scribed by Richard Stong

Publisher: Elsevier Science
Year: 1987
Tongue: English
Weight: 314 KB
Volume: 65
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(87)90212-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Hamiltonian cycles in cayley color graph

Hamiltonian cycles in cayley color graphs

✍ Joseph B. Klerlein 📂 Article 📅 1978 🏛 John Wiley and Sons 🌐 English ⚖ 165 KB 👁 1 views

## Abstract A group Γ is said to possess a hamiltonian generating set if there exists a minimal generating set Δ for Γ such that the Cayley color graph __D__~Δ~(Γ) is hamiltonian. It is shown that every finite abelian group has a hamiltonian generating set. Certain classes of nonabelian groups are

Hamiltonian cycles and paths in Cayley g

Hamiltonian cycles and paths in Cayley graphs and digraphs — A survey

✍ Stephen J. Curran; Joseph A. Gallian 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 927 KB

Cayley graphs arise naturally in computer science, in the study of word-hyperbolic groups and automatic groups, in change-ringing, in creating Escher-like repeating patterns in the hyperbolic plane, and in combinatorial designs. Moreover, Babai has shown that all graphs can be realized as an induced

On edge-Hamiltonian property of Cayley g

On edge-Hamiltonian property of Cayley graphs

✍ C.C. Chen 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 368 KB

Let G be a group generated by X. A Cayley graph ouer G is defined as a graph G(X) whose vertex set is G and whose edge set consists of all unordered pairs [a, b] with a, b E G and am'b E X U X-', where X-t denotes the set (x-t ( .x E X}. When X is a minimal generating set or each element of X is of

Hamiltonian decompositions of Cayley gra

Hamiltonian decompositions of Cayley graphs on Abelian groups

✍ 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

On certain Hamiltonian cycles in planar

On certain Hamiltonian cycles in planar graphs

✍ B�hme, T.; Harant, J.; Tk�?, M. 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 162 KB 👁 2 views

The problem is considered under which conditions a 4-connected planar or projective planar graph has a Hamiltonian cycle containing certain prescribed edges and missing certain forbidden edges. The results are applied to obtain novel lower bounds on the number of distinct Hamiltonian cycles that mus

Pseudo-cartesian product and hamiltonian

Pseudo-cartesian product and hamiltonian decompositions of Cayley graphs on abelian groups

✍ 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