Subgraph isomorphism problem

In theoretical computer science, the subgraph isomorphism problem is a computational task in which two graphs G {\displaystyle G} and H {\displaystyle H} are given as input, and one must determine whether G {\displaystyle G} contains a subgraph that is isomorphic to H {\displaystyle H} . Subgraph isomorphism is a generalization of both the maximum clique problem and the problem of testing whether a graph contains a Hamiltonian cycle, and is therefore NP-complete.

Source: Wikipedia — Subgraph isomorphism problem (CC BY-SA 4.0)