Minimal Eulerian Circuit in a Labeled Digraph

DOI10.1007/11682462_67MaRDI QIDQ3525806zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Eduardo Moreno, Martin Matamala

Publication date 18 September 2008

Published in LATIN 2006: Theoretical Informatics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11682462_67

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20)

Recommendations

• Minimum Eulerian circuits and minimum de Bruijn sequences
• Graph-Theoretic Concepts in Computer Science
• Euler digraphs
• On the Complexity of Universality for Partially Ordered NFAs
• scientific article; zbMATH DE number 3946164

Cited in

(4)

• Minimum Eulerian circuits and minimum de Bruijn sequences
• On the complexity of the Eulerian closed walk with precedence path constraints problem
• Graph-Theoretic Concepts in Computer Science
• Simplicity in Eulerian circuits: uniqueness and safety

This page was built for publication: Minimal Eulerian Circuit in a Labeled Digraph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3525806)