Algorithmic methods of finite discrete structures. Topological graph drawing (part IV)
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.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.