1. V. E. Alekseev, On the number of maximal stable sets in graphs from hereditary classes, in Combinatorial-Algebraic Methods in Applied Mathematics (Gorkiy University, Gorky, 1991), pp. 3–13 (in Russian)
2. V. E. Alekseev, A polynomial algorithm for finding maximum independent sets in fork-free graphs. Discret. Anal. Oper. Res. Ser. 1, 3–19 (1999) (in Russian)
3. C. Berge, Two theorems in graph theory. Proc. Natl. Acad. Sci. U. S. A. 43, 842–844 (1957)
4. R. Boliac, V.V. Lozin, An augmenting graph approach to the stable set problem in P
5-free graphs. Discret. Appl. Math. 131(3), 567–575 (2003)
5. J.A. Bondy, U.S.R. Murty, Graph theory, in Graduate Text in Mathematics, vol. 244 (Springer, Berlin, 2008)