arXiv Open Access 2025

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

Sergey Kurapov Maxim Davidovsky

Lihat Sumber

Abstrak

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.

Topik & Kata Kunci

math.CO cs.DM

Penulis (2)

Sergey Kurapov

Maxim Davidovsky

Format Sitasi

APA MLA BibTeX

Kurapov, S., Davidovsky, M. (2025). Algorithmic methods of finite discrete structures. Topological graph drawing (part IV). https://arxiv.org/abs/2507.16759

Akses Cepat

Lihat di Sumber

Informasi Jurnal

Tahun Terbit: 2025
Bahasa: en
Sumber Database: arXiv
Akses: Open Access ✓