Page "Graph theory" Paragraph 44

A similar problem is finding induced subgraphs in a given graph.

Again, some important graph properties are hereditary with respect to induced subgraphs, which means that a graph has a property if and only if all induced subgraphs also have it.

Finding maximal induced subgraphs of a certain kind is also often NP-complete.

For example,