Cheston, Grant A.; Jap, Tjoen Seng A survey of the algorithmic properties of simplicial, upper bound and middle graphs. (English) Zbl 1161.68648 J. Graph Algorithms Appl. 10, No. 2, 159-190 (2006). Summary: Three classes of graphs, simplicial, upper bound, and middle graphs, have been known for some time, but many of their algorithmic properties have not been published. The definitions for these graph classes are reviewed, and their relationships with other common graph classes (especially line and perfect graphs) are presented. Efficient algorithms are referenced or outlined to recognize each class of graphs. Finally, for each class of graphs and most of the common parameters of graphs, either an algorithm or an NP-complete result is presented, or it is referenced in the literature. Cited in 8 Documents MSC: 68R10 Graph theory (including graph drawing) in computer science Keywords:Efficient algorithms PDFBibTeX XMLCite \textit{G. A. Cheston} and \textit{T. S. Jap}, J. Graph Algorithms Appl. 10, No. 2, 159--190 (2006; Zbl 1161.68648) Full Text: DOI EuDML EMIS