Algorithmic methods of finite discrete structures. Topological graph drawing (part IV)
Combinatorics
2025-07-23 v1 Discrete Mathematics
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.
Cite
@article{arxiv.2507.16759,
title = {Algorithmic methods of finite discrete structures. Topological graph drawing (part IV)},
author = {Sergey Kurapov and Maxim Davidovsky},
journal= {arXiv preprint arXiv:2507.16759},
year = {2025}
}
Comments
67 pages, in Ukrainian language, 83 figures, a preprint of monography