[Nauty] Generation of edge-colored graphs

Rajesh Pavan Sunkari pavan at Glue.umd.edu
Thu May 13 10:14:02 EST 2004


Hello,
I was wondering if one could use/modify 'geng' to generate all
non-isomorphic edge-colored graphs on n vertices with k-colors. If not
what would be the best way to generate them fast.

Similarly for vertex-colored graphs.

How should I be representing an edge-colored graph similar to the
setword-array representation followed in nauty. One obvious way is to
define a 2-dimensional integer array.

Regards,
Pavan.





More information about the Nauty mailing list