Before revision:  We prove an almost-complete complexity dichotomy for this problem when the input is restricted to graphs that do not contain a graph ~ H as an induced subgraph.
After revision:  We prove an almost-complete complexity dichotomy for this problem when the input is restricted to graphs that do not contain a graph H as an induced subgraph.