Tatiana Makarovskikh

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
This paper is devoted to extension of the mathematical theory of A-trails and OE-trails for planar graphs. These types of trails imply constructing such trails avoiding intersection of not-passed edges with passed cycles and ensuring absence of intersected transitions at each graph vertex. In terms of cutting process, a planar graph is to be the cutting(More)
The polynomial algorithm for constructing a special Eulerian cycle in a plane connected 4-regular graph G = (V,E) is presented in the paper. First of all any cycle of the passed edges does not contain any unpassed edges (the condition of ordered enclosing (OE-cycle). At second, the next edge of this cycle can be chosen from one of two neighbouring edges(More)
  • 1