Hamiltonicity of digraphs for universal cycles of permutations

DOI10.1016/j.ejc.2005.05.007zbMath1088.05050OpenAlexW2023951018MaRDI QIDQ2493100

Garth Isaak

Publication date: 9 June 2006

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejc.2005.05.007

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Eulerian and Hamiltonian graphs (05C45)

Related Items (4)

Eulerian Circuits with No Monochromatic Transitions in Edge-Colored Digraphs with all Vertices of Outdegree Three ⋮ Compatible spanning circuits and forbidden induced subgraphs ⋮ On a Greedy Algorithm to Construct Universal Cycles for Permutations ⋮ Compatible Eulerian circuits in Eulerian (di)graphs with generalized transition systems

Cites Work

• Unnamed Item
• Unnamed Item
• Universal cycles of \(k\)-subsets and \(k\)-permutations
• Digraphs on permutations
• Hamiltonian cycles and paths in Cayley graphs and digraphs---a survey
• A Simple Proof of Rankin's Campanological Theorem
• A survey: Hamiltonian cycles in Cayley graphs

This page was built for publication: Hamiltonicity of digraphs for universal cycles of permutations