Pages that link to "Item:Q1208348"
From MaRDI portal
The following pages link to Universal cycles for combinatorial structures (Q1208348):
Displaying 50 items.
- Universal and overlap cycles for posets, words, and juggling patterns (Q293633) (← links)
- Packing analogue of \(k\)-radius sequences (Q298335) (← links)
- The lexicographically smallest universal cycle for binary strings with minimum specified weight (Q405571) (← links)
- Number of cycles in the graph of 312-avoiding permutations (Q472163) (← links)
- Universal cycle packings and coverings for \(k\)-subsets of an \(n\)-set (Q503623) (← links)
- Binary bubble languages and cool-lex order (Q645969) (← links)
- The existence of \(k\)-radius sequences (Q645973) (← links)
- Universal cycles of \(k\)-subsets and \(k\)-permutations (Q686158) (← links)
- On the de Bruijn torus problem (Q690027) (← links)
- Hamiltonian decompositions of complete \(k\)-uniform hypergraphs (Q712220) (← links)
- Universal cycles of classes of restricted words (Q712255) (← links)
- Cycles in the graph of overlapping permutations avoiding barred patterns (Q727057) (← links)
- A universal cycle for strings with fixed-content (which are also known as multiset permutations) (Q832908) (← links)
- Locating patterns in the de Bruijn torus (Q906472) (← links)
- Universal and near-universal cycles of set partitions (Q907241) (← links)
- Growing perfect cubes (Q941376) (← links)
- de Bruijn sequences and de Bruijn graphs for a general language (Q1044740) (← links)
- Universal cycles for permutations (Q1044883) (← links)
- Minimum Eulerian circuits and minimum de Bruijn sequences (Q1044891) (← links)
- On universal cycles for multisets (Q1044893) (← links)
- A recursive construction for universal cycles of 2-subspaces (Q1044895) (← links)
- Universal cycles of \((n - 1)\)-partitions of an \(n\)-set (Q1044896) (← links)
- Hamiltonian paths in Cayley graphs (Q1044918) (← links)
- Multicover Ucycles (Q1343787) (← links)
- Path-sequential labellings of cycles (Q1356672) (← links)
- The combinatorics of binary arrays (Q1365504) (← links)
- Computing generalized de Bruijn sequences (Q1680534) (← links)
- Enumerating cycles in the graph of overlapping permutations (Q1685994) (← links)
- On universal partial words (Q1689916) (← links)
- Universal partial words over non-binary alphabets (Q1694683) (← links)
- A new universal cycle for permutations (Q1696522) (← links)
- On shortening \(u\)-cycles and \(u\)-words for permutations (Q1741513) (← links)
- Shorthand universal cycles for permutations (Q1759661) (← links)
- New classes of perfect maps. I (Q1906142) (← 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)
- Gray cycles of maximum length related to \(k\)-character substitutions (Q2096591) (← links)
- Shortened universal cycles for permutations (Q2097185) (← links)
- Enumerations of universal cycles for \(k\)-permutations (Q2144520) (← links)
- 1-overlap cycles for Steiner triple systems (Q2249792) (← links)
- Quasi-Eulerian hypergraphs (Q2401411) (← links)
- On uniquely \(k\)-determined permutations (Q2477375) (← 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)
- Designing preference functions for de Bruijn sequences with forbidden words (Q2673980) (← links)
- Properties of the cycles that contain all vectors of weight \(\le k\) (Q2678985) (← links)
- Efficient Ranking of Lyndon Words and Decoding Lexicographically Minimal de Bruijn Sequence (Q2830442) (← links)
- De Bruijn Sequences for the Binary Strings with Maximum Density (Q3078396) (← links)
