Pages that link to "Item:Q1741513"
From MaRDI portal
The following pages link to On shortening \(u\)-cycles and \(u\)-words for permutations (Q1741513):
Displaying 5 items.
- Shortened universal cycles for permutations (Q2097185) (← 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)