The Induced Subgraph Isomorphism problem on two input graphs G and H is to decide whether G has an induced subgraph isomorphic to H. Already for the restricted case where H is a complete graph the problem is NP-complete, as it is then equivalent to the Clique problem. In a recent paper [10] Marx and Schlotter show that Induced Subgraph Isomorphism is NP-complete when G and H are restricted to b...
