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
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