Detecting K₂, ₃ as an induced minor

We consider a natural generalization of chordal graphs, in which every minimal separator induces a subgraph with independence number at most 2. Such graphs can be equivalently defined as graphs that do not contain the complete bipartite graph K₂, ₃ as an induced minor, that is, graphs from which K₂, ₃ cannot be obtained by a sequence of edge contractions and vertex deletions. We develop a polynomial-time algorithm for recognizing these graphs. Our algorithm relies on a characterization of K₂, ₃-induced minor-free graphs in terms of excluding particular induced subgraphs, called Truemper configurations.