Assertion: given graph | /r/MadeOf | any of the forbidden minors
Facets:
Source sentences:
text: Thus, by applying the polynomial time algorithm for testing whether a given graph contains any of the forbidden minors, it is theoretically possible to recognize the members of any minor-closed family in polynomial time.