1. A. Brandstädt, V.B. Le, S. Olariu, Linear-time recognition of the P4-structure of trees, Rutcor Research Report RRR 19-96, Rutgers University, 1996.
2. A. Brandstädt, V.B. Le, S. Olariu, Efficiently recognizing the P4-structure of trees and of bipartite graphs without short cycles, to appear in Graphs Combin.
3. A semi-strong perfect graph conjecture;Chvátal;Ann. Discrete Math.,1984
4. On the P4-structure of perfect graphs III. Partner decompositions;Chvátal;J. Combin. Theory B,1987
5. On the P4-structure of perfect graphs I. Even decompositions;Chvátal;J. Combin. Theory B,1985