1. V.E. Alekseev, On the local restrictions effect on the complexity of finding the graph independence number, Combinatorial-algebraic Methods in Applied Mathematics, Gorkiy University Press, Gorkiy, 1983, pp. 3–13 (in Russian).
2. A polynomial algorithm for finding maximum independent sets in fork-free graphs;Alekseev;Discrete Anal. Oper. Res., Ser. 1,1999
3. On the stability number of claw-free P5-free and more general graphs;Brandstädt;Discrete Appl. Math.,1999
4. L. Butz, P.L. Hammer, D. Haussmann, Reduction methods for the vertex packing problem, Proceedings of the 17th Conference on Probability Theory, Brasov, 1982, VNU Science Press, Utrecht, 1985, pp. 73–79.
5. Vertex cover;Chen;J. Algorithms,2001