Pages that link to "Item:Q2547222"

The following pages link to A proof of Golomb's conjecture for the de Bruijn graph (Q2547222):

Displaying 23 items.

• Partitioning de Bruijn graphs into fixed-length cycles for robot identification and tracking (Q313805) (← links)
• Number of holes in unavoidable sets of partial words. I. (Q450546) (← links)
• Number of holes in unavoidable sets of partial words. II. (Q450549) (← links)
• On the complexity of deciding avoidability of sets of partial words (Q606993) (← links)
• On cardinalities of \(k\)-abelian equivalence classes (Q728280) (← links)
• The directed genus of the de Bruijn graph (Q1044882) (← links)
• An algorithm for generating necklaces of beads in two colors (Q1084396) (← links)
• Covering the de Bruijn graph (Q1176741) (← links)
• A new look at the de Bruijn graph (Q1199424) (← links)
• Asymptotically-tight bounds on the number of cycles in generalized de Bruijn-Good graphs (Q1199445) (← links)
• Universal circuit matrix for adjacency graphs of feedback functions (Q1318845) (← links)
• The analysis of de Bruijn sequences of non-extremal weight (Q1584352) (← links)
• Open maps: small and large holes with unusual properties (Q1791656) (← links)
• On the classification of deBruijn sequences (Q1910540) (← links)
• A number theoretic view on binary shift registers (Q2088954) (← links)
• On binary de Bruijn sequences from LFSRs with arbitrary characteristic polynomials (Q2414937) (← links)
• Minimum Number of Holes in Unavoidable Sets of Partial Words of Size Three (Q3000493) (← links)
• On the Complexity of Deciding Avoidability of Sets of Partial Words (Q3637218) (← links)
• Lower Density Selection Schemes via Small Universal Hitting Sets with Short Remaining Path Length (Q5040364) (← links)
• A Randomized Parallel Algorithm for Efficiently Finding Near-Optimal Universal Hitting Sets (Q5041795) (← links)
• UNAVOIDABLE SETS OF CONSTANT LENGTH (Q5692237) (← links)
• UNAVOIDABLE AND ALMOST UNAVOIDABLE SETS OF WORDS (Q5703672) (← links)
• Graphs with the unique path property: Structure, cycles, factors, and constructions (Q6142656) (← links)