Publications in Math-Net.Ru
-
All tight descriptions of $3$-paths in plane graphs with girth at least $9$
Sib. Èlektron. Mat. Izv., 15 (2018), 1174–1181
-
Continuation of a $3$-coloring from a $7$-face onto a plane graph without $3$-cycles
Sib. Èlektron. Mat. Izv., 1 (2004), 117–128
-
Continuation of a 3-coloring from a 6-face to a plane graph without 3-cycles
Diskretn. Anal. Issled. Oper., Ser. 1, 10:3 (2003), 3–11
-
On the continuation of a 3-coloring from two vertices in a plane graph without 3-cycles
Diskretn. Anal. Issled. Oper., Ser. 1, 9:1 (2002), 3–26
-
On a structural property of plane graphs
Diskretn. Anal. Issled. Oper., Ser. 1, 7:4 (2000), 5–19
-
A polynomial algorithm for the approximate solution of a problem in scheduling theory
Upravliaemie systemy, 1988, no. 28, 8–11
-
О базисе вектор-каркасов обыкновенного связного графа
Upravliaemie systemy, 1971, no. 8, 76–83
© , 2026