6 papers
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…
Algorithmic methods of finite discrete structures. Topological graph drawing (part II)
Sergey Kurapov, Maxim Davidovsky
A visualized graph is a powerful tool for data analysis and synthesis tasks. In this case, the task of visualization constitutes not only in displaying vertices and edges according…
Algorithmic methods of finite discrete structures. Topological graph drawing (part I)
Sergey Kurapov, Maxim Davidovsky
Modern methods of graph theory describe a graph up to isomorphism, which makes it difficult to create mathematical models for visualizing graph drawings on a plane. The topological…
Algorithmic methods of finite discrete structures. Automorphism of Nonseparable Graphs
Sergey Kurapov, Maxim Davidovsky
The monography examines the problem of constructing a group of automorphisms of a graph. A graph automorphism is a mapping of a set of vertices onto itself that preserves adjacency…
Algorithmic methods of finite discrete structures. Isomorphism of Nonseparable Graphs
Sergey Kurapov, Maxim Davidovsky
In this monography, it is proposed to consider the concepts of spectra of edge cuts and edge cycles of a graph as a basic mathematical structure for solving the problem of graph is…
Klein Group And Four Color Theorem
Sergey Kurapov
In this work methods of construction of cubic graphs are analyzed and a theorem of existence of a colored disc traversing each pair of linked edges belonging to an elementary cycle…