Algorithmic methods of finite discrete structures. Topological graph drawing (part IV)
Fuente:
arXiv
Salvato in:
| Autori principali: | , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2025
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866915405127221248 |
|---|---|
| author | Kurapov, Sergey Davidovsky, Maxim |
| author_facet | Kurapov, Sergey Davidovsky, Maxim |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2507_16759 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Algorithmic methods of finite discrete structures. Topological graph drawing (part IV) Kurapov, Sergey Davidovsky, Maxim Combinatorics Discrete Mathematics 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. |
| title | Algorithmic methods of finite discrete structures. Topological graph drawing (part IV) |
| topic | Combinatorics Discrete Mathematics |
| url | https://arxiv.org/abs/2507.16759 |