How to generate all graphs on $n$ vertices including a given subgraph?

225 Views Asked by At

I'm working on a graph theory problem and as an intermediate step I need to draw all the simple graphs on $n$ vertices including a given subgraph, is there an algorithm to make sure I can generate all of them without repetition (up to isomorphism) or missing one of them?