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 .
A similar problem is finding induced subgraphs in a given graph .
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 .
A similar problem is finding induced subgraphs in a given graph .