1. V.E. Alekseev, On the number of maximal stable sets in graphs from hereditary classes, in: Combinatorial-Algebraic Methods in Discrete Optimization, University of Nizhny Novgorod, 1991, pp. 5–8 (in Russian)
2. On easy and hard hereditary classes of graphs with respect to the independent set problem;Alekseev;Discrete Appl. Math.,2004
3. Augmenting graphs for independent sets;Alekseev;Discrete Appl. Math.,2004
4. On graphs with polynomially solvable maximum-weight clique problem;Balas;Networks,1989
5. J. Bang-Jensen, J. Huang, G. MacGillivray, A. Yeo, Domination in convex bipartite and convex-round graphs, manuscript 2002