Chordal probe graphs

In this paper, we introduce the class of chordal probe graphs which are a generalization of both interval probe graphs and chordal graphs. A graph G is chordal probe if its vertices can be partitioned into two sets P (probes) and N (non-probes) where N is a stable set and such that G can be extended to a chordal graph by adding edges between non-probes. We show that chordal probe graphs may contain neither an odd-length chordless cycle nor the complement of a chordless cycle, hence they are perfect graphs. We present a complete hierarchy with separating examples for chordal probe and related classes of graphs. We give polynomial time recognition algorithms for the subfamily of chordal probe graphs which are also weakly chordal, first in the case of a fixed, given partition of the vertices into probes and non-probes, and second in the more general case where no partition is given.