Generating non-bipartite graphs.
asked 2017-01-18 00:24:19 -0500
This post is a wiki. Anyone with karma >750 is welcome to improve it.
I use graphs.nauty_geng('n') to generate graphs on n vertices. By adding the flag -c (resp. -b), I will get filtered list of connected (resp. bipartite) graphs on n vertices. For example, see the following code:
c=0 for G in graphs.nauty_geng('6, -c'): c=c+1 if not G.is_bipartite(): print "Graph" +str(c)+":" G.show()
This will generate a list of connected non-bipartite graphs on 6 vertices. I want to do the same by avoiding the if loop I have used. For example by replacing above with graphs.nauty_geng('6,-b'), I can get the list of bipartite ones. Is there any direct command which works just like -b and -c work?
Thanks in advance.