A proof of Golomb's conjecture for the de Bruijn graph
From MaRDI portal
Publication:2547222
DOI10.1016/0095-8956(72)90006-8zbMath0221.05068OpenAlexW1980664567MaRDI QIDQ2547222
Publication date: 1972
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0095-8956(72)90006-8
Related Items
Lower Density Selection Schemes via Small Universal Hitting Sets with Short Remaining Path Length, An algorithm for generating necklaces of beads in two colors, A Randomized Parallel Algorithm for Efficiently Finding Near-Optimal Universal Hitting Sets, Partitioning de Bruijn graphs into fixed-length cycles for robot identification and tracking, On the classification of deBruijn sequences, On the complexity of deciding avoidability of sets of partial words, On binary de Bruijn sequences from LFSRs with arbitrary characteristic polynomials, Graphs with the unique path property: Structure, cycles, factors, and constructions, Number of holes in unavoidable sets of partial words. I., Number of holes in unavoidable sets of partial words. II., UNAVOIDABLE SETS OF CONSTANT LENGTH, Covering the de Bruijn graph, Minimum Number of Holes in Unavoidable Sets of Partial Words of Size Three, UNAVOIDABLE AND ALMOST UNAVOIDABLE SETS OF WORDS, A new look at the de Bruijn graph, Asymptotically-tight bounds on the number of cycles in generalized de Bruijn-Good graphs, On cardinalities of \(k\)-abelian equivalence classes, Open maps: small and large holes with unusual properties, On the Complexity of Deciding Avoidability of Sets of Partial Words, The directed genus of the de Bruijn graph, The analysis of de Bruijn sequences of non-extremal weight, A number theoretic view on binary shift registers, Universal circuit matrix for adjacency graphs of feedback functions
Cites Work
