Efficient Recognition of Chordal and Cograph Cover-Incomparability Graphs
Chordal graphs having at most two independent simplicial vertices are exactly the chordal graphs which are also cover-incomparability (C-I) graphs. A similar result holds for cographs, and linear-time recognition algorithms are developed for these classes of C-I graphs.