Minimum Eulerian circuits and minimum de Bruijn sequences

DOI10.1016/j.disc.2007.11.027zbMath1207.05071OpenAlexW1987387088WikidataQ57707486 ScholiaQ57707486MaRDI QIDQ1044891

Eduardo Moreno, Martin Matamala

Publication date: 15 December 2009

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2007.11.027

zbMATH Keywords

de Bruijn sequencesEulerian circuitslabelled digraph

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Directed graphs (digraphs), tournaments (05C20) Eulerian and Hamiltonian graphs (05C45)

Related Items (2)

Constructing de Bruijn sequences with co-lexicographic order: the \(k\)-ary grandmama sequence ⋮ The lexicographically smallest universal cycle for binary strings with minimum specified weight

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• de Bruijn sequences and de Bruijn graphs for a general language
• Universal cycles for combinatorial structures
• Necklaces of beads in k colors and k-ary de Bruijn sequences
• Minimal Eulerian Circuit in a Labeled Digraph
• A Survey of Full Length Nonlinear Shift Register Cycle Algorithms
• Generating necklaces
• De Bruijn and Kautz bus networks
• Graph-Theoretic Concepts in Computer Science
• On Unicursal Paths in a Network of Degree 4
• Normal Recurring Decimals

This page was built for publication: Minimum Eulerian circuits and minimum de Bruijn sequences