A new universal cycle for permutations

DOI10.1007/s00373-017-1778-3zbMath1382.05005OpenAlexW2617509461MaRDI QIDQ1696522

Dennis Wong

Publication date: 14 February 2018

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-017-1778-3

zbMATH Keywords

permutationsde Bruijn sequencesuniversal cyclesGray codes

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Permutations, words, matrices (05A05) Eulerian and Hamiltonian graphs (05C45)

Related Items (3)

Enumerations of universal cycles for \(k\)-permutations ⋮ Constructing the first (and coolest) fixed-content universal cycle ⋮ Shortened universal cycles for permutations

Cites Work

• Universal cycles of \(k\)-subsets and \(k\)-permutations
• Universal cycles for permutations
• Universal cycles for combinatorial structures
• Shorthand universal cycles for permutations
• Faster Generation of Shorthand Universal Cycles for Permutations
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A new universal cycle for permutations