scientific article; zbMATH DE number 3505007
From MaRDI portal
Publication:4085749
zbMath0323.05119MaRDI QIDQ4085749
No author found.
Publication date: 1975
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Enumeration in graph theory (05C30) Directed graphs (digraphs), tournaments (05C20) History of combinatorics (05-03)
Related Items (16)
Generalizing the classic greedy and necklace constructions of de Bruijn sequences and universal cycles ⋮ The origins of combinatorics on words ⋮ An unoriented variation on de Bruijn sequences ⋮ Computing generalized de Bruijn sequences ⋮ The lexicographically smallest universal cycle for binary strings with minimum specified weight ⋮ Constructing the first (and coolest) fixed-content universal cycle ⋮ Regularity of k-Abelian Equivalence Classes of Fixed Cardinality ⋮ Avoidance of split overlaps ⋮ Quantifying local randomness in human DNA and RNA sequences using Erdös motifs ⋮ Containing All Permutations ⋮ On minimal Sturmian partial words ⋮ Language operations with regular expressions of polynomial size ⋮ The combinatorics of N. G. de Bruijn ⋮ De Bruijn Sequences for the Binary Strings with Maximum Density ⋮ Circular slider graphs: de Bruijn, Kautz, Rauzy, lamplighters and spiders ⋮ Maximal state complexity and generalized de Bruijn words
This page was built for publication:
