1. V.E. Alekseev, On influence of the local restrictions to the complexity of finding the independence number of a graph, Kombinatorno-algebraicheskie metody v prikladnoy matematike, Gorki State University, Gorki, 1982, pp. 3–13 (in Russian).
2. V.E. Alekseev, On the number of deadlock independent sets in graphs from hereditary classes, Kombinatorno-algebraicheskie metody v diskretnoy optimizacii, N. Novgorod, Nizhniy Novgorod State University, 1991, pp. 5–8 (in Russian).
3. On the complexity of some problems for hereditary classes of graphs;Alekseev;Diskret. Mat.,1992
4. Stability number of bull- and chair-free graphs;De Simone;Discrete Appl. Math.,1993
5. Computers and Intractability: A Guide to the Theory of NP-Completeness;Garey,1979