✦ LIBER ✦

Hamiltonian cycles in cayley color graphs

✍ Scribed by Joseph B. Klerlein

Publisher: John Wiley and Sons
Year: 1978
Tongue: English
Weight: 165 KB
Volume: 2
Category: Article
ISSN: 0364-9024
DOI: 10.1002/jgt.3190020108

No coin nor oath required. For personal study only.

✦ Synopsis

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 also investigated.

📜 SIMILAR VOLUMES

Alternating hamiltonian cycles in two co

Alternating hamiltonian cycles in two colored complete bipartite graphs

✍ A. G. Chetwynd; A. J. W. Hilton 📂 Article 📅 1992 🏛 John Wiley and Sons 🌐 English ⚖ 269 KB 👁 2 views

## Abstract We give necessary and sufficient conditions for the existence of an alternating Hamiltonian cycle in a complete bipartite graph whose edge set is colored with two colors.

Hamiltonian cycles in n-extendable graph

Hamiltonian cycles in n-extendable graphs

✍ Ken-ichi Kawarabayashi; Katsuhiro Ota; Akira Saito 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 88 KB

## Abstract A graph __G__ of order at least 2__n__+2 is said to be __n__‐extendable if __G__ has a perfect matching and every set of __n__ independent edges extends to a perfect matching in __G__. We prove that every pair of nonadjacent vertices __x__ and __y__ in a connected __n__‐extendable graph

Hamiltonian groups are color-graph-hamil

Hamiltonian groups are color-graph-hamiltonian

✍ Joseph B. Klerlein; A. Gregory Starling 📂 Article 📅 1981 🏛 John Wiley and Sons 🌐 English ⚖ 171 KB

## Abstract A group Γ is said to be color ‐graph ‐hamiltonian if Γ has a minimal generating set Δ such that the Cayley color graph __D__~Δ~(Γ) is hamiltonian. It is shown that every hamiltonian group is color ‐graph ‐hamiltonian.

Hamilton-Connected Cayley Graphs on Hami

Hamilton-Connected Cayley Graphs on Hamiltonian Groups

✍ 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 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

Hamiltonian cycles in 3-connected claw-f

Hamiltonian cycles in 3-connected claw-free graphs

✍ MingChu Li 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 437 KB 👁 2 views