Almost all Cayley graphs are hamiltonian
From MaRDI portal
Publication:4897049
DOI10.1007/BF02108156zbMath0858.05068OpenAlexW1561134786MaRDI QIDQ4897049
Ji Xiang Meng, Qiong Xiang Huang
Publication date: 27 October 1996
Published in: Acta Mathematica Sinica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02108156
Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Eulerian and Hamiltonian graphs (05C45)
Related Items (max. 100)
Random Latin square graphs ⋮ Combinatorics. Abstracts from the workshop held January 1--7, 2023 ⋮ Infinite circulant digraphs and random infinite circulant digraphs ⋮ A survey on Hamiltonicity in Cayley graphs and digraphs on different groups ⋮ Hamiltonian paths in Cayley graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Cayley digraphs of prime-power order are hamiltonian
- On the automorphism groups of almost all Cayley graphs
- Hamilton cycles in regular 2-connected graphs
- Paths and circuits in finite groups
- A Remark on Stirling's Formula
- Exceptional trivalent cayley graphs for dihedral groups
- The number of solutions of xp = 1 in a finite group
- Connectivity of transitive graphs
- A survey: Hamiltonian cycles in Cayley graphs
This page was built for publication: Almost all Cayley graphs are hamiltonian
