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 Univ. Press, Gorkiy, 1983, pp. 3–13 (in Russian).
2. V.E. Alekseev, On the number of maximal independent sets in graphs from hereditary classes, Combinatorial-algebraic methods in discrete optimization, University of Nizhny Novgorod, 1991, pp. 5–8 (in Russian).
3. On graphs with polynomially solvable maximum-weight clique problem;Balas;Networks,1989
4. A nice class for the vertex packing problem;Bertolazzi;Discrete Appl. Math.,1997
5. On coloring the nodes of a network;Brooks;Proc. Cambridge Phil. Soc.,1941