Hamilton-connected derangement graphs on \(S_ n\)
From MaRDI portal
Publication:1336702
DOI10.1016/0012-365X(94)90028-0zbMath0808.05069MaRDI QIDQ1336702
David J. Rasmussen, Carla D. Savage
Publication date: 9 March 1995
Published in: Discrete Mathematics (Search for Journal in Brave)
05C38: Paths and cycles
05C25: Graphs and abstract algebra (groups, rings, fields, etc.)
05C45: Eulerian and Hamiltonian graphs
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Cayley digraphs and (1,j,n)-sequencings of the alternating groups \(A_ n\)
- Hamilton cycles in regular 2-connected graphs
- Generating Permutations with k-Differences
- Connectivity of transitive graphs
- Generation of Permutations by Adjacent Transposition
- A survey: Hamiltonian cycles in Cayley graphs