On Wed, 11 Oct 2017, David Joyner wrote:
1) list(graphs.nauty_geng(0)) gives empty list, whereas Sage knows a graph of 0 vertices. Can someone ask McKay to handle this special case too?
Wouldn't it be easier to simply catch that case in the nauty_geng method?
Could be done, but needs some string processing, as the argument is given as a string to nauty. And anyways, isn't this a corner-case bug?
2) Is there an example of graph property that holds after deleting any vertex but not necessarily after deleting an edge? Or the converse?
Completeness, if you start with a complete graph, is preserved if you delete a vertex but not if you delete an edge.
True. But it is propably not what one will generate orderly... -- Jori Mäntysalo
