[Nauty-list] Generating graphs with fixed induced subgraph

Marko Milosevic ninja643 at gmail.com
Thu Feb 7 10:14:44 EST 2008

On 2/7/08, Brendan McKay <bdm at cs.anu.edu.au> wrote:
> I wonder if your subgraph is permanently distinguished (as if it has
> a colour different from all the new vertices), or if you just want
> the graphs that happen to have an induced subgraph isomorphic to
> your required subgraph.  The former case is quite a bit easier than
> the latter, since the latter requires searching for subgraphs in
> addition to the one you started with.

My graph is permanently distinguished, i.e. fixed on first k vertices. I
want to add the remaining n-k vertices in all possible ways. I hoped that
it's not too hard.

-------------- next part --------------
An HTML attachment was scrubbed...
URL: http://mailman.anu.edu.au/mailman/private/nauty/attachments/20080207/370849c8/attachment.html 

More information about the Nauty mailing list