[Nauty-list] geng 33 vertices and diameter 2
Hoang Minh Nguyen
nhminh at cs.newcastle.edu.au
Wed Oct 19 16:46:36 EST 2005
At the moment geng is limited to generating graphs of order up to
32. It seems that this restriction is due to the data structure used to
store intermediate graphs?
I would like to know if there is a way to modify geng to generate ALL graphs
of order 33 with the restriction that the diameter of each graph is 2.
Is there a good way to speed up the search given the diameter restriction?
It might be a hard problem but just ask in case someone has any idea :-).
More information about the Nauty