Publications in Math-Net.Ru
-
On planar graphs without list $3$-coloring
Sib. Èlektron. Mat. Izv., 5 (2008), 685–690
-
Sufficient conditions for planar graphs to be $2$-distance $(\Delta+1)$-colorable
Sib. Èlektron. Mat. Izv., 1 (2004), 129–141
-
A lower bound for the chromatic number of graphs with a given maximal degree and girth
Sib. Èlektron. Mat. Izv., 1 (2004), 99–109
-
On the isometric embedding of arbitrary graphs into a graph of a given diameter possessing the metric continuation property
Diskretn. Anal. Issled. Oper., Ser. 1, 8:3 (2001), 73–80
-
On an algorithm for the edge coloring of multigraphs
Diskretn. Anal. Issled. Oper., Ser. 1, 7:3 (2000), 72–85
-
Regular subpseudographs of regular pseudographs
Mat. Zametki, 43:2 (1988), 263–275
-
Three-regular parts of four-regular graphs
Mat. Zametki, 36:2 (1984), 239–259
-
Regular subgraphs of regular graphs
Dokl. Akad. Nauk SSSR, 265:1 (1982), 43–44
© , 2024