e/Forbidden graph characterization

Information
has gloss	eng: A forbidden graph characterization is a method of specifying or describing a family of graph or hypergraph structures whereby a structure belongs to the family in question if and only if the structure in question contain graphs called forbidden graphs. The forbidden graphs could be * subgraphs, * graph minors, * homeomorphic subgraphs (also called topological minors) * spanning subgraphs * induced subgraphs with additional conditions if required.
lexicalization	eng: forbidden graph characterization
instance of	c/Graph families