Planarity testing and constructing the topological drawing of a plane graph (DFS) | Prikladnaya Diskretnaya Matematika - Applied Discrete Mathematics. 2016. № 2(32).

In this article we present a new graph planarity testing algorithm along with the construction of mathematical framework used for representing topological drawings of plane graphs. This mathematical framework is based on the notions of graph isometric cycles and rotation of graph vertices. It is shown that the system of isometric cycles of a graph induces the rotation of its vertices for representing topological drawing of the plane graph. In contrast to the classical planarity testing algorithms, e. g. the Hopcroft - Tarjan algorithm, the topological drawing obtained as a result of the proposed algorithm execution is used subsequently for the visualization of the planar graph. Computational complexity of the proposed algorithm is estimated by O(m), where m is the number of edges in the graph.