The Hamiltonicity of directed \(\sigma\)-\(\tau\) Cayley graphs (Or: A tale of backtracking)

DOI10.1016/0166-218X(94)00078-RzbMath0856.05063OpenAlexW2009281999MaRDI QIDQ1345967

Andrew Weston, Frank Ruskey, Ming Jiang

Publication date: 5 December 1996

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0166-218x(94)00078-r

zbMATH Keywords

Hamiltonian pathbacktrackingdirected Cayley graph

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Graph algorithms (graph-theoretic aspects) (05C85) Eulerian and Hamiltonian graphs (05C45)

Related Items (2)

Hamiltonian cycles and paths in Cayley graphs and digraphs---a survey ⋮ Ranking and unranking permutations in linear time

Cites Work

• On hamiltonian circuits in Cayley diagrams
• A method and two algorithms on the theory of partitions
• Paths and circuits in finite groups
• Determining the Hamilton-connectedness of certain vertex-transitive graphs
• Doubly adjacent gray codes for the symmetric group
• Hamilton Cycles that Extend Transposition Matchings in Cayley Graphs of $S_n $
• A mechanical counting method and combinatorial applications
• A survey: Hamiltonian cycles in Cayley graphs

This page was built for publication: The Hamiltonicity of directed \(\sigma\)-\(\tau\) Cayley graphs (Or: A tale of backtracking)