1. On contractible graphs;Alekseev;Problemy Kibernet,1979
2. V.E. Alekseev, On influence of local restrictions to the complexity of finding the independence number of a graph, in: Combinatorial and Algebraic Methods in Applied Mathematics, ed. A.A. Markov, Gorky State University, Gorky, 1982, pp. 3–13 (in Russian).
3. V.E. Alekseev, V.V. Lozin, On determining the independence number by graph transformations, in: Proceedings of the Fifth Twente Workshop Graphs and Combinatorial Optimization, Enschede, NL, May 20–22, 1997, pp. 5–8.
4. Ch. Ebenegger, P.L. Hammer, D. de Werra, Pseudo-Boolean functions and stability of graphs, in: Algebraic and combinatorial Methods in Operations Research, eds. R.E. Burkard, R.A. Cuninghame-Green and U. Zimmermann, North-Holland, Amsterdam, Ann. Discrete Math. 19 (1984) 83–97.
5. On graphs without P5 and P5;Fouquet;Discrete Math,1995