✦ LIBER ✦

Hamiltonian groups are color-graph-hamiltonian

✍ Scribed by Joseph B. Klerlein; A. Gregory Starling

Publisher: John Wiley and Sons
Year: 1981
Tongue: English
Weight: 171 KB
Volume: 5
Category: Article
ISSN: 0364-9024
DOI: 10.1002/jgt.3190050209

No coin nor oath required. For personal study only.

✦ Synopsis

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.

📜 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

Tough enough chordal graphs are Hamilton

Tough enough chordal graphs are Hamiltonian

✍ Chen, Guantao; Jacobson, Michael S.; K�zdy, Andr� E.; Lehel, Jen? 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 152 KB 👁 3 views

We prove that every 18-tough chordal graph has a Hamiltonian cycle.

Sparse pseudo-random graphs are Hamilton

Sparse pseudo-random graphs are Hamiltonian

✍ Michael Krivelevich; Benny Sudakov 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 133 KB

## Abstract In this article we study Hamilton cycles in sparse pseudo‐random graphs. We prove that if the second largest absolute value λ of an eigenvalue of a __d__‐regular graph __G__ on __n__ vertices satisfies and __n__ is large enough, then __G__ is Hamiltonian. We also show how our main resu

3-colorability of 4-regular hamiltonian

3-colorability of 4-regular hamiltonian graphs

✍ Herbert Fleischner; Gert Sabidussi 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 187 KB 👁 1 views

## Abstract On the model of the cycle‐plus‐triangles theorem, we consider the problem of 3‐colorability of those 4‐regular hamiltonian graphs for which the components of the edge‐complement of a given hamiltonian cycle are non‐selfcrossing cycles of constant length ≥ 4. We show that this problem is

Directed hamiltonian graphs

✍ Yannis Manoussakis 📂 Article 📅 1992 🏛 John Wiley and Sons 🌐 English ⚖ 386 KB

## Abstract We give a new condition involving degrees sufficient for a digraph to be hamiltonian.

Hamiltonian line graphs

✍ Richard A. Brualdi; Robert F. Shanny 📂 Article 📅 1981 🏛 John Wiley and Sons 🌐 English ⚖ 358 KB

## Abstract Sufficient conditions on the degrees of a graph are given in order that its line graph have a hamiltonian cycle.