1. V.E. Alekseev, On the number of maximal stable sets in graphs from hereditary classes, Combinatorial-algebraic methods in discrete optimization, University of Nizhny Novgorod, 1991, pp. 5–8 (in Russian).
2. V.E. Alekseev, A polynomial algorithm for finding maximum independent sets in fork-free graphs, Discrete Anal. Oper. Res. Ser. 1 6(4) (1999) 3–19 (in Russian).
3. V.E. Alekseev, On the local restrictions effect on the complexity of finding the graph independence number, combinatorial-algebraic methods in applied mathematics, Gorkiy University, 1983, pp. 3–13 (in Russian).
4. V.E. Alekseev, V.V. Lozin, On local transformations of graphs that preserve the independence number, Discrete Anal. Oper. Res. Ser. 1 5(1) (1998) 3–19 (in Russian).
5. C. Arbib, R. Mosca, On (P5, diamond)-free graphs, Research report. Department of Pure and Applied Mathematics, Università di I'Aquila, 1999.