[Nauty] isomorphism of graphs generated by geng

[Sterten at aol.com]

In einer eMail vom 26.06.2005 12:05:17 Westeuropäische Sommerzeit schreibt  
Sterten at aol.com:

>you could create the lexicographically minimal graph from each  class.
>This should ensure that the requirement with the edges is  satisfied.
>(does it really? delete the last 1 in the upper triangle..will it  work 
always ?)




OK, I see now that it doesn't.
Deleting the last 1 already fails for K_n, but deleting other edges fails  
also.
-------------- next part --------------
An HTML attachment was scrubbed...
URL: http://mailman.anu.edu.au/mailman/private/nauty/attachments/20050626/512ed02e/attachment.html