1. On the number of maximal stable sets in graphs from hereditary classes;Alekseev,1991
2. Polynomial algorithm for finding the largest independent sets in graphs without forks;Alekseev;Discrete Appl. Math.,2004
3. D.V. Andrade, E. Boros, V. Gurvich, On graphs whose maximal cliques and stable sets intersect, RUTCOR Research Reports 17-2006 Rutgers University, 2006, 70 pp.
4. Complexity and Approximation. Combinatorial Optimization Problems and Their Approximability Properties;Ausiello,1999
5. On graphs with polynomially solvable maximum-weight clique problem;Balas;Networks,1989