1. A polynomial algorithm for finding maximum independent sets in fork-free graphs;Alekseev;Discrete Anal. Oper. Res.,1999
2. On the p-connectedness of graphs;Babel;Discrete Appl. Math.,1999
3. A. Brandstädt, (P5, diamond)-Free graphs revisited: structure and linear time optimization, Discrete Applied Mathematics, in press.
4. A. Brandstädt, V. Giakoumakis, J.-M. Vanherpe, On prime (P5,claw)-free, (P5,bull)-free, and (bull,claw)-free graphs and the maximum stable set problem, Manuscript, 2000.
5. A. Brandstädt, D. Kratsch, On (P5,gem)-free and (P5,gem,co-gem)-free graphs: structure and algorithmic applications, Manuscript, 2000.