The mainwindow where you can choose the degree-partition looks like:

In this example you can see a degree-partition with 50 vertices. Here we have
2 vertices of degree 1, 10 vertices of degree 2, 8 vertices of degree 3,... .
Because of the use of the homomorphism-principle, during the generation we may
obtain situations, where the operating group is trivial. So we get the possibility
to describe large sets of pairwise non-isomorphic solutions implicitly.
In this way in the shown example, we computed 34824038400 graphs in about
25 seconds and are also able to store these graphs with a very small amount of space.