The Syntactic Complexity of Eulerian Graphs

DOI10.1007/978-3-540-75414-5_13zbMath1148.68401OpenAlexW1607201781MaRDI QIDQ3522868

Antonios Kalampakas

Publication date: 4 September 2008

Published in: Algebraic Informatics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-75414-5_13

zbMATH Keywords

graph language recognizability

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (2)

Syntactic recognizability of graphs with fuzzy attributes ⋮ On the syntactic complexity of tree series

Cites Work

• An axiomatization of graphs
• Context-free graph grammars and concatenation of graphs
• Recognizability of graph and pattern languages
• Exponential Numbers
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The Syntactic Complexity of Eulerian Graphs