Problems with complexity between P and NP that have  NP-complete generalizations Can anyone list some well-known problems that satisfies the following conditions:

1. has a generalization problem that is known to be NP-complete
2. has not been proved to be NP-complete nor has a known polynomial time solution.
Most famously: Graph Isomorphism, and Dominating Set on Tournaments.

Generalizations are natural.