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