Assertion: subgraph isomorphism | /r/CapableOf | remain np-complete
Facets:
value: in the planar case
type: LOCATION
Source sentences:
text: Because the Hamiltonian cycle problem is NP-complete even for planar graphs, this shows that subgraph isomorphism remains NP-complete even in the planar case.