Assertion: graph | /r/HasProperty | np-complete
Facets:
value: in general
type: OTHER
Source sentences:
text: The problem of deciding whether a graph G contains H as a minor is NP-complete in general; for instance, if H is a cycle graph with the same number of vertices as G, then H is a minor of G if and only if G contains a Hamiltonian cycle.