1. Basavaraju, M., Chandran, L.S., Karthick, T.: Maximum weight independent sets in hole- and dart-free graphs. Discrete Appl. Math. 160, 2364–2369 (2012)
2. Berry, A., Bordat, J.-P., Heggernes, P.: Recognizing weakly triangulated graphs by edge separability. Nord. J. Comput. 7, 164–177 (2000)
3. Berry, A., Brandstädt, A., Giakoumakis, V., Maffray, F.: Efficiently recognizing, decomposing and triangulating hole- and diamond-free graphs, manuscript 2012; accepted for Discrete Appl. Math. (2012)
4. Brandstädt, A.: ( $$P_5$$ P 5 , diamond)-free graphs revisited: structure and linear time optimization. Discrete Appl. Math. 138, 13–27 (2004)
5. Brandstädt, A., Giakoumakis, V.: Maximum weight independent sets in hole- and co-chair-free graphs. Inf. Process. Lett. 112, 67–71 (2012)