1. V.E. Alekseev, A polynomial algorithm for finding maximum independent sets in fork-free graphs, Discr. Analysis and Oper. Research Vol. 6 No. 4 (1999) 3–19
2. C. Arbib, R. Mosca, On the stable set problem in (P
5, diamond)-free graphs, Manuscript 1995
3. L. Babel, S. Olariu, On the p-connectedness of graphs: A survey, Discrete Applied Math. 95 (1999) 11–33
4. A. Brandstädt, (P
5,diamond)-Free Graphs Revisited: Structure and Linear Time Optimization, Manuscript 2000
5. A. Brandstädt, F.F. Dragan, On the clique width of graph classes defined by three forbidden P
4 extensions, Manuscript 2001