Showing math.HOShow all
2 papers · 1 filter
math.HO2024
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…
math.HO2024
Algorithmic methods of finite discrete structures. The Four Color Theorem. Theory, methods, algorithms
Sergey Kurapov, Maxim Davidovsky
The Four color problem is closely related to other branches of mathematics and practical applications. More than 20 of its reformulations are known, which connect this problem with…