Hamiltonian paths in Cayley graphs
From MaRDI portal
Publication:1044918
DOI10.1016/j.disc.2009.02.018zbMath1229.05184OpenAlexW2166532439MaRDI QIDQ1044918
Publication date: 15 December 2009
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2009.02.018
Paths and cycles (05C38) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Eulerian and Hamiltonian graphs (05C45)
Related Items (18)
On the spectrum of finite Cayley graphs ⋮ Cayley graphs of order 6pq and 7pq are Hamiltonian ⋮ Random Latin square graphs ⋮ Burnside's problem, spanning trees and tilings. ⋮ Absorption Cayley graph ⋮ On a Combinatorial Generation Problem of Knuth ⋮ Hamiltonian normal Cayley graphs ⋮ Combinatorics. Abstracts from the workshop held January 1--7, 2023 ⋮ Codes, lower bounds, and phase transitions in the symmetric rendezvous problem ⋮ Hamilton cycles in dense vertex-transitive graphs ⋮ Hamiltonian cycles in Cayley graphs of imprimitive complex reflection groups ⋮ The property of edge-disjoint Hamiltonian cycles in transposition networks and hypercube-like networks ⋮ Cayley graphs of order \(30p\) are Hamiltonian ⋮ Generating triples of involutions of groups of Lie type of rank 2 over finite fields ⋮ Hamiltonian cycles in normal Cayley graphs ⋮ Proof of the middle levels conjecture ⋮ A survey on Hamiltonicity in Cayley graphs and digraphs on different groups ⋮ Hamilton cycles and paths in vertex-transitive graphs-current directions
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Cayley digraphs of prime-power order are hamiltonian
- Explicit group-theoretical constructions of combinatorial schemes and their application to the design of expanders and concentrators
- Sorting in \(c \log n\) parallel steps
- Ramanujan graphs
- A Hamilton cycle in the Cayley graph of the \(\langle 2,p,3 \rangle\) presentation of PSL\(_ 2(p)\)
- Universal cycles for combinatorial structures
- Graph-theoretic properties in computational complexity
- On the structure of Hamiltonian cycles in Cayley graphs of finite quotients of the modular group
- Generating triples of involutions of alternating groups
- Generation of classical groups
- Discrete groups, expanding graphs and invariant measures. Appendix by Jonathan D. Rogawski
- Generation of certain matrix groups by three involutions, two of which commute
- Entropy waves, the zig-zag graph product, and new constant-degree expanders
- Hamiltonian cycles and paths in Cayley graphs and digraphs---a survey
- Generating triples of involutions of Chevalley groups over a finite field of characteristic 2
- Uniform expansion bounds for Cayley graphs of \(\text{SL}_2(\mathbb F_p)\).
- On finite simple groups of characteristic 2 type
- The square of every two-connected graph is Hamiltonian
- Tough graphs and Hamiltonian circuits.
- The probability of generating a finite classical group
- Expander codes
- MORE ON GENERATORS FOR ALTERNATING AND SYMMETRIC GROUPS
- Two-Processor Scheduling with Start-Times and Deadlines
- Doubly adjacent gray codes for the symmetric group
- Random Cayley graphs and expanders
- Almost all regular graphs are hamiltonian
- Sparse pseudo‐random graphs are Hamiltonian
- Generating triples of involutions of large sporadic groups
- Strong bias of group generators: an obstacle to the “product replacement algorithm”
- Almost all Cayley graphs are hamiltonian
- Some subgroups of SL(3, z) generated by involutions
- Expanders that beat the eigenvalue bound
- Über die Nichtexistenz eines Knotenpunktes, durch den alle längsten Wege eines Graphen gehen
- Tilings of the Torus and the Klein Bottle and Vertex-Transitive Graphs on a Fixed Surface
- A survey: Hamiltonian cycles in Cayley graphs
This page was built for publication: Hamiltonian paths in Cayley graphs
