Recognition of $$\boldsymbol{r}$$-Almost-Trees by Automata Traversing Graphs
A. A. Demidova · Moscow University Mathematics Bulletin · 2025
The subject of the paper is an automaton that traverses connected plane simple undirected graphs in order to determine whether they are $$r$$ -almost-trees. The paper provides an algorithm and time estimates for establishing this property, as well as a description of the automaton under consideration.