Publications in Math-Net.Ru
-
A constructive existence theorem related to local transformations of graphs for the independent set problem
Zhurnal SVMO, 21:2 (2019), 215–221
-
On the complexity of the vertex $3$-coloring problem for the hereditary graph classes with forbidden subgraphs of small size
Diskretn. Anal. Issled. Oper., 25:4 (2018), 112–130
-
On the complexity for constructing a 3-colouring for planar graphs with short facets
Zhurnal SVMO, 20:2 (2018), 199–205
-
Polynomial-time solvability of the independent set problem in a certain class of subcubic planar graphs
Diskretn. Anal. Issled. Oper., 24:3 (2017), 35–60
-
A method of graph reduction and its applications
Diskr. Mat., 29:3 (2017), 114–125
-
Theorems of existence and sufficiency connected with local transformations of graphs for the $k$-colourability problem
Zhurnal SVMO, 19:2 (2017), 98–104
© , 2024