Algorithmic complexity of checking isomorphism of graphs that are topological invariants of gradient-like diffeomorphisms on surfaces

Title	Algorithmic complexity of checking isomorphism of graphs that are topological invariants of gradient-like diffeomorphisms on surfaces
Authors	S. K. Zinina¹, N. I. Krasulin¹ ¹National Research Mordovia State University
Annotation	The topological classification of structurally stable flows, as well as the topological classification of some multidimensional cascades, is reduced to the combinatorial problem of distinguishing graphs up to isomorphism. This paper evaluates the algorithmic complexity of isomorphism testing for three-color and two-color graphs, which are topological invariants for gradient-like surface diffeomorphisms.
Keywords	topological classification, gradient-like diffeomorphisms, topological conjugacy, three-color graph, two-color graph, algorithmic complexity.
Citation	Zinina S. K., Krasulin N. I. ''Algorithmic complexity of checking isomorphism of graphs that are topological invariants of gradient-like diffeomorphisms on surfaces'' [Electronic resource]. Mathematical modeling, numerical methods, and software systems: Collection of materials from the 12th All‑Russian Scientific Youth School‑Seminar named after E. V. Voskresensky (Saransk, July 21–24, 2026). - pp. 89-91. Available at: https://conf.svmo.ru/files/2026/papers/paper80.pdf. - Date of access: 25.09.2026.