1. The effect of local constraints on the complexity of determination of the graph independence number;Alekseev;Combin.-Algeb. Methods Appl. Math.,1982
2. Maximum weight independent sets in hole- and dart-free graphs;Basavaraju;Discrete Appl. Math.,2012
3. A. Berry, A. Brandstädt, V. Giakoumakis, F. Maffray, The atomic structure of hole- and diamond-free graphs. Manuscript (2011).
4. Clique separator decomposition of hole- and diamond-free graphs and algorithmic consequences;Berry;Discrete Appl. Math.,2012
5. On algorithms for (P5, gem)-free graphs;Bodlaender;Theoret. Comput. Sci.,2005