[Nauty] generate all S-free graphs

Sterten at aol.com Sterten at aol.com
Fri Nov 22 16:40:01 EST 2002


Given a set S of graphs of small size,
I want to generate efficiently all graphs of size n,
which don't contain any of the graphs from S as induced subgraph.

I already have a subroutine, which checks whether
G contains a graph from S.
The property is hereditary : as soon as there is a forbidden
subgraph we can immediately backtrack.


Can I modify geng.c easily or will it be difficult for me ?


Guenter.
-------------- next part --------------
An HTML attachment was scrubbed...
URL: http://mailman.anu.edu.au/mailman/private/nauty/attachments/20021122/1f7e4a32/attachment.html 


More information about the Nauty mailing list