[Nauty] Generate all non-isomorphic graphs without edges between the last k vertices

[J.K.R. Bausch]

Hi all!

I would like to generate all non-isomorphic graphs on N vertices (e.g. 
N=10), but such that there is no edges within the subset of vertices > k 
(e.g. k=6).

Is that possible with geng? Or any other idea?

Thanks & best,
Johannes