More generally, there may be a family of vertex-induced subgraphs whose presence characterizes if a given graph has some property. For example, a simple
graph is a line graphiff
it does not contain one of the 9 Beineke graphs
as a vertex-induced subgraph. The following table summarizes some graph families
which have forbidden induced subgraph obstructions.