[Nauty-list] labelg with coloured graphs

[Sterten at aol.com]

I think I would convert them to normal graphs with same automorphismgroup 
by adding vertices or edges
 
add one vertex for each color and connect the n original vertices to their  
color-vertex
connect the color vertices with each other
one 5th additional vertex connects to the n original ones
and to one 6th that has only that one edge
 
6 is unique with only 1 edge
5 is uniqe as neighbor of 6
the colors are unique as non-neighbors of 6
-------------- next part --------------
An HTML attachment was scrubbed...
URL: http://mailman.anu.edu.au/mailman/private/nauty/attachments/20120504/486d72b9/attachment.html