Universal cycles of \(k\)-subsets and \(k\)-permutations
From MaRDI portal
Publication:686158
DOI10.1016/0012-365X(93)90330-VzbMath0783.05001MaRDI QIDQ686158
Publication date: 10 March 1994
Published in: Discrete Mathematics (Search for Journal in Brave)
Permutations, words, matrices (05A05) Directed graphs (digraphs), tournaments (05C20) Eulerian and Hamiltonian graphs (05C45)
Related Items (25)
Packing analogue of \(k\)-radius sequences ⋮ Multicover Ucycles ⋮ Enumerations of universal cycles for \(k\)-permutations ⋮ Generalizing the classic greedy and necklace constructions of de Bruijn sequences and universal cycles ⋮ Equivalence class universal cycles for permutations ⋮ Euler tours in hypergraphs ⋮ The lexicographically smallest universal cycle for binary strings with minimum specified weight ⋮ Constructing the first (and coolest) fixed-content universal cycle ⋮ A new universal cycle for permutations ⋮ Short k‐radius sequences, k‐difference sequences and universal cycles ⋮ Locating patterns in the de Bruijn torus ⋮ An inductive approach to constructing universal cycles on the \(k\)-subsets of \([n\)] ⋮ The existence of \(k\)-radius sequences ⋮ On a Greedy Algorithm to Construct Universal Cycles for Permutations ⋮ Containing All Permutations ⋮ Universal cycle packings and coverings for \(k\)-subsets of an \(n\)-set ⋮ Extension of universal cycles for globally identifying colorings of cycles ⋮ Hamiltonicity of digraphs for universal cycles of permutations ⋮ Universal cycles of classes of restricted words ⋮ Graph universal cycles of combinatorial objects ⋮ Universal cycles for permutations ⋮ A recursive construction for universal cycles of 2-subspaces ⋮ Universal cycles of \((n - 1)\)-partitions of an \(n\)-set ⋮ Universal cycles for minimum coverings of pairs by triples, with application to 2-radius sequences ⋮ Shortened universal cycles for permutations
Cites Work
This page was built for publication: Universal cycles of \(k\)-subsets and \(k\)-permutations
