Pages that link to "Item:Q686158"
From MaRDI portal
The following pages link to Universal cycles of \(k\)-subsets and \(k\)-permutations (Q686158):
Displaying 23 items.
- Packing analogue of \(k\)-radius sequences (Q298335) (← links)
- 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)
- Extension of universal cycles for globally identifying colorings of cycles (Q526222) (← links)
- The existence of \(k\)-radius sequences (Q645973) (← links)
- Universal cycles of classes of restricted words (Q712255) (← links)
- Locating patterns in the de Bruijn torus (Q906472) (← links)
- Universal cycles for permutations (Q1044883) (← links)
- A recursive construction for universal cycles of 2-subspaces (Q1044895) (← links)
- Universal cycles of \((n - 1)\)-partitions of an \(n\)-set (Q1044896) (← links)
- Multicover Ucycles (Q1343787) (← links)
- A new universal cycle for permutations (Q1696522) (← links)
- Equivalence class universal cycles for permutations (Q1910573) (← links)
- An inductive approach to constructing universal cycles on the \(k\)-subsets of \([n]\) (Q1953498) (← links)
- Graph universal cycles of combinatorial objects (Q2020052) (← links)
- Shortened universal cycles for permutations (Q2097185) (← links)
- Enumerations of universal cycles for \(k\)-permutations (Q2144520) (← links)
- Hamiltonicity of digraphs for universal cycles of permutations (Q2493100) (← links)
- Generalizing the classic greedy and necklace constructions of de Bruijn sequences and universal cycles (Q2635088) (← links)
- Euler tours in hypergraphs (Q2658380) (← links)
- Universal cycles for minimum coverings of pairs by triples, with application to 2-radius sequences (Q3117226) (← links)
- Constructing the first (and coolest) fixed-content universal cycle (Q6103527) (← links)
- Short k‐radius sequences, k‐difference sequences and universal cycles (Q6187437) (← links)