1. H. Bodlaender, T. Kloks, D. Kratsch, and H. Müller, Treewidth and minimum fill-in on d-trapezoid graphs, Technical Report UU-CS-1995-34, Utrecht University.
2. A. Brandstädt, Classes of bipartite graphs related to chordal graphs, Discrete Appl. Math.
32 (1991) 51–60.
3. D. G. Corneil, Y. Perl, and L. K. Stewart, Cographs: recognition, applications, and algorithms, Congressus Numerantium, 43 (1984) 249–258.
4. M. Farber, Characterization of strongly chordal graphs, Discrete Math.
43 (1983) 173–189.
5. F. Gavril, Algorithms for maximum k-colorings and k-coverings of transitive graphs, Networks
17 (1987) 465–470.