sentences:  Forbidden graph characterizations may be used in algorithms for testing whether a graph belongs to a given family.In many cases, it is possible to test in polynomial time whether a given graph contains any of the members of the obstruction set, and therefore whether it belongs to the family defined by that obstruction set.In order for a family to have a forbidden graph characterization, with a particular type of substructure, the family must be closed under substructures.