Golumbic, Martin Charles; Rotics, Udi On the clique-width of some perfect graph classes. (English) Zbl 1320.05090 Int. J. Found. Comput. Sci. 11, No. 3, 423-443 (2000). MSC: 05C69 05C75 PDFBibTeX XMLCite \textit{M. C. Golumbic} and \textit{U. Rotics}, Int. J. Found. Comput. Sci. 11, No. 3, 423--443 (2000; Zbl 1320.05090) Full Text: DOI
McKee, Terry A. Maximal connected cographs in distance-hereditary graphs. (English) Zbl 0953.05024 Util. Math. 57, 73-80 (2000). Reviewer: Lutz Volkmann (Aachen) MSC: 05C12 05C75 PDFBibTeX XMLCite \textit{T. A. McKee}, Util. Math. 57, 73--80 (2000; Zbl 0953.05024)
Dragan, Feodor F.; Nicolai, Falk LexBFS-orderings of distance-hereditary graphs with application to the diametral pair problem. (English) Zbl 0940.05024 Discrete Appl. Math. 98, No. 3, 191-207 (2000). Reviewer: H.Müller (Jena) MSC: 05C12 05C85 68R10 PDFBibTeX XMLCite \textit{F. F. Dragan} and \textit{F. Nicolai}, Discrete Appl. Math. 98, No. 3, 191--207 (2000; Zbl 0940.05024) Full Text: DOI
Broersma, H. J.; Dahlhaus, E.; Kloks, T. A linear time algorithm for minimum fill-in and treewidth for distance hereditary graphs. (English) Zbl 0940.05064 Discrete Appl. Math. 99, No. 1-3, 367-400 (2000). Reviewer: H.L.Bodlaender (Utrecht) MSC: 05C85 68R10 05C12 05C05 PDFBibTeX XMLCite \textit{H. J. Broersma} et al., Discrete Appl. Math. 99, No. 1--3, 367--400 (2000; Zbl 0940.05064) Full Text: DOI