𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Almost all Cayley graphs are hamiltonian

✍ Scribed by Meng Jixiang; Huang Qiongxiang

Publisher
Institute of Mathematics, Chinese Academy of Sciences and Chinese Mathematical Society
Year
1996
Tongue
English
Weight
278 KB
Volume
12
Category
Article
ISSN
1439-7617

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Almost all Cayley graphs have diameter 2
Almost all Cayley graphs have diameter 2
✍ Jixiang Meng; Qiongxiang Huang πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 118 KB

We prove that almost all Cayley graphs have diameter 2.

Almost all comparability graphs are UPO
Almost all comparability graphs are UPO
✍ Rolf H. MΓΆhring πŸ“‚ Article πŸ“… 1984 πŸ› Elsevier Science 🌐 English βš– 430 KB

An undirected graph G is called a comparability graph if there exists an orientation of its edges such that the resulting relation on its vertex set is a partial order P. A comparability graph is UPO (i.e. uniquely partially orderable) if, except for its dual p-x, there is only one such partial orde

On edge-hamiltonian Cayley graphs
On edge-hamiltonian Cayley graphs
✍ Ulrike Baumann πŸ“‚ Article πŸ“… 1994 πŸ› Elsevier Science 🌐 English βš– 667 KB
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