In this paper we prove that the set of directed Eulerian graphs is not recognizable. On the other hand, the set of directed graphs with an Eulerian underlying graph is shown to be recognizable. Furthermore, we compute the syntactic complexity of this language and we compare it with that of connected graphs. © Springer-Verlag Berlin Heidelberg 2007.
CITATION STYLE
Kalampakas, A. (2007). The syntactic complexity of eulerian graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4728 LNCS, pp. 208–217). Springer Verlag. https://doi.org/10.1007/978-3-540-75414-5_13
Mendeley helps you to discover research relevant for your work.