Algorithmic methods of finite discrete structures. Topological graph drawing (part IV)

2025/07/22 by Sergey Kurapov, Kurapov, Sergey, Maxim Davidovsky +1
Computer Science · #Combinatorics (math.CO) #Computational Geometry and Mesh Generation #Digital Image Processing Techniques #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics #Graph Theory and Algorithms

paper · pdf · doi:10.48550/arxiv.2507.16759

openalex publication_date 2025/07/22 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

The chapter presents mathematical models intended for creating a topological drawing of a non-separable non-planar graph based on the methods of G. Ringel's vertex rotation theory. The induced system of cycles generates a topological drawing of a certain thickness. A method for determining the location of imaginary vertices by finding the intersection of connections on a plane is presented. A topological drawing of a maximum planar subgraph is used as a basis.

Related

• Algorithmic methods of finite discrete structures. Topological graph drawing (part III)
• Algorithmic methods of finite discrete structures. Topological graph drawing (part I)
• Algorithmic methods of finite discrete structures. Topological graph drawing (part II)
• Drawing non-planar graphs with rotation systems on the Klein bottle
• A census of graph-drawing algorithms based on generalized transversal structures