Publications in Math-Net.Ru
-
Weighted well-covered graphs and complexity questions
Mosc. Math. J., 4:2 (2004), 523–528
-
Strong $k$-colorings of graphs
Diskr. Mat., 13:1 (2001), 78–89
-
A characterization of well-covered graphs in terms of forbidden costable subgraphs
Mat. Zametki, 67:1 (2000), 52–56
-
Locally bounded hereditary subclasses of $k$-colorable graphs
Diskretn. Anal. Issled. Oper., Ser. 1, 5:3 (1998), 3–16
-
An analogue of the Whitney theorem for edge graphs of multigraphs, and edge multigraphs
Diskr. Mat., 9:2 (1997), 98–105
-
Graphs with a matroid number that does not exceed 2
Diskr. Mat., 2:2 (1990), 82–88
© , 2024