1. Distance-hereditary graphs;Bandelt;J. Combin. Theory (B),1986
2. The pathwidth and treewidth of cographs;Bodlaender;SIAM J. Discrete Math.,1993
3. H.L. Bodlaender, U. Rotics, Computing the treewidth and the minimum fill-in with the modular composition, Preprint Utrecht University UU-CS-2001-22, July 2001.
4. A. Brandstädt, D. Kratsch, On the structure of (P5,gem)-free graphs, Discrete Applied Math., 2004, to appear.
5. Graph Classes;Brandstädt,1999