1. On the Local Restrictions Effect on the Complexity of Finding the Graph Independence Number, Combinatorial-algebraic Methods in Applied Mathematics;Alekseev,1983
2. Two theorems in graph theory;Berge;Proc. Natl. Acad. Sci. USA,1957
3. On computing the dissociation number and the induced matching number of bipartite graphs;Boliac;Ars Combin.,2004
4. Minimum k-path vertex cover;Brešar;Discrete Appl. Math.,2011
5. Induced matching;Cameron;Discrete Appl. Math.,1989