The following pages link to Universal cycles for permutations (Q1044883):
Displayed 22 items.
- The lexicographically smallest universal cycle for binary strings with minimum specified weight (Q405571) (← links)
- Universal cycle packings and coverings for \(k\)-subsets of an \(n\)-set (Q503623) (← links)
- A universal cycle for strings with fixed-content (which are also known as multiset permutations) (Q832908) (← links)
- Enumerating cycles in the graph of overlapping permutations (Q1685994) (← links)
- A new universal cycle for permutations (Q1696522) (← links)
- Shorthand universal cycles for permutations (Q1759661) (← links)
- Graph universal cycles of combinatorial objects (Q2020052) (← links)
- Gray codes and symmetric chains (Q2072179) (← links)
- Shortened universal cycles for permutations (Q2097185) (← links)
- Enumerations of universal cycles for \(k\)-permutations (Q2144520) (← links)
- Supertrees (Q2181994) (← links)
- Generalized de Bruijn words for primitive words and powers (Q2515571) (← links)
- Generalizing the classic greedy and necklace constructions of de Bruijn sequences and universal cycles (Q2635088) (← links)
- Euler tours in hypergraphs (Q2658380) (← links)
- (Q5002744) (← links)
- Sparse Kneser graphs are Hamiltonian (Q5006324) (← links)
- Containing All Permutations (Q5144492) (← links)
- On a Greedy Algorithm to Construct Universal Cycles for Permutations (Q5384431) (← links)
- The feasible region for consecutive patterns of permutations is a cycle polytope (Q5918948) (← links)
- The feasible region for consecutive patterns of permutations is a cycle polytope (Q5919059) (← links)
- Graph universal cycles: compression and connections to universal cycles (Q6044313) (← links)
- Constructing the first (and coolest) fixed-content universal cycle (Q6103527) (← links)