Hamilton-connected derangement graphs on \(S_ n\)

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)

zbMATH Keywords

Cayley graphsymmetric groupHamilton pathderangement graphHamilton-connected

Mathematics Subject Classification ID

Paths and cycles (05C38) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Eulerian and Hamiltonian graphs (05C45)

Related Items

Hamiltonian cycles and paths in Cayley graphs and digraphs---a survey

Cites Work

• 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
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item