3 papers
math.CO2025
Algorithmic methods of finite discrete structures. Topological graph drawing (part III)
Sergey Kurapov, Maxim Davidovsky
The manuscript considers mathematical models for creating a topological drawing of a graph based on the methods of G. Ringel's vertex rotation theory. An algorithm is presented for…
cs.DM2024
Algorithmic methods of finite discrete structures. Graph clique problem
Sergey Kurapov, Maxim Davidovsky
The monography presents a new algorithm for finding the clique of maximal length in a nonseparable graph. The algorithm is based on the properties of the representation of a clique…
math.CO2024
Algorithmic methods of finite discrete structures. Hamiltonian cycle of a complete graph and the Traveling salesman problem
Sergey Kurapov, Maxim Davidovsky, Svetlana Polyuga
The monography considers the problem of constructing a Hamiltonian cycle in a complete graph. A rule for constructing a Hamiltonian cycle based on isometric cycles of a graph is es…