The following pages link to (Q5808057):
Displaying 50 items.
- Multi-Eulerian tours of directed graphs (Q281626) (← links)
- Universal and overlap cycles for posets, words, and juggling patterns (Q293633) (← links)
- Partitioning de Bruijn graphs into fixed-length cycles for robot identification and tracking (Q313805) (← links)
- Wavelet analysis on symbolic sequences and two-fold de Bruijn sequences (Q315651) (← links)
- Non-uniqueness of minimal superpermutations (Q389216) (← links)
- The number of Euler tours of random directed graphs (Q396813) (← links)
- Bounds from a card trick (Q414410) (← links)
- Exact counting of Euler tours for generalized series-parallel graphs (Q414430) (← links)
- Towards a theory of patches (Q414472) (← links)
- Spectra of uniform hypergraphs (Q417456) (← links)
- Sandpile groups of generalized de Bruijn and Kautz graphs and circulant matrices over finite fields (Q468704) (← links)
- Number of cycles in the graph of 312-avoiding permutations (Q472163) (← links)
- Chinese postman problem on edge-colored multigraphs (Q516812) (← links)
- Sandpile groups and spanning trees of directed line graphs (Q618292) (← links)
- The strategic value of recall (Q665106) (← links)
- The interlace polynomial of a graph (Q705880) (← links)
- Burrows-Wheeler transformations and de Bruijn words (Q714849) (← links)
- On cardinalities of \(k\)-abelian equivalence classes (Q728280) (← links)
- A simple shift rule for \(k\)-ary de Bruijn sequences (Q729788) (← links)
- The combinatorics of N. G. de Bruijn (Q740470) (← links)
- The origins of combinatorics on words (Q872058) (← links)
- Shuffling biological sequences with motif constraints (Q935837) (← links)
- Minimum Eulerian circuits and minimum de Bruijn sequences (Q1044891) (← links)
- Universal cycles of \((n - 1)\)-partitions of an \(n\)-set (Q1044896) (← links)
- Independently prescribable sets of n-letter words (Q1077431) (← links)
- The full cycles in a Young coset (Q1140654) (← links)
- The enumeration of directed closed Euler trails and directed Hamiltonian circuits by Lagrangian methods (Q1154484) (← links)
- Enumeration of restricted three-dimensional lattice paths with fixed numbers of turns and an application (Q1209639) (← links)
- On Eulerian circuits and words with prescribed adjacency patterns (Q1213887) (← links)
- Complexite et circuits euleriens dans les sommes tensorielles de graphes (Q1220085) (← links)
- Line-digraphs, arborescences and theorems of Tutte and Knuth (Q1226497) (← links)
- Words with prescribed adjacencies (Q1227758) (← links)
- Aneulerian digraphs and the determination of those Eulerian digraphs having an odd number of directed Eulerian paths (Q1245843) (← links)
- Hypercubes, shuffle-exchange graphs and de Bruijn digraphs (Q1310233) (← links)
- On algebras satisfying symmetric identities (Q1340179) (← links)
- Multicover Ucycles (Q1343787) (← links)
- Characterising the linear complexity of span 1 de Bruijn sequences over finite fields. (Q1380344) (← links)
- Euler circuits and DNA sequencing by hybridization (Q1585320) (← links)
- Construction of de Bruijn sequences from product of two irreducible polynomials (Q1696134) (← links)
- Alternating knot diagrams, Euler circuits and the interlace polynomial (Q1840823) (← links)
- New classes of perfect maps. I (Q1906142) (← links)
- Routing problems: A bibliography (Q1908308) (← links)
- An alternative formula for the number of Euler trails for a class of digraphs (Q1918565) (← links)
- Amount of nonconstructivity in deterministic finite automata (Q1959651) (← links)
- An efficiently generated family of binary de Bruijn sequences (Q2022156) (← links)
- Parameterized counting of partially injective homomorphisms (Q2032353) (← links)
- A reverse Aldous-Broder algorithm (Q2041828) (← links)
- Sequence graphs: characterization and counting of admissible elements (Q2056908) (← links)
- Classical results for alternating virtual links (Q2090593) (← links)
- Maximal state complexity and generalized de Bruijn words (Q2113383) (← links)
