MaxDegree => an integer, default value null, an upper bound on the degrees of the vertices
MinDegree => an integer, default value null, a lower bound on the degrees of the vertices
Only4CycleFree => a Boolean value, default value false, whether to only allow graphs without 4-cycles
OnlyBiconnected => a Boolean value, default value false, whether to only allow biconnected graphs
OnlyBipartite => a Boolean value, default value false, whether to only allow bipartite graphs
OnlyConnected => a Boolean value, default value false, whether to only allow connected graphs
OnlyTriangleFree => a Boolean value, default value false, whether to only allow graphs without triangles (3-cycles)
Outputs:
G, a list, the graphs satisfying the input conditions
Description
This method generates all graphs on n vertices subject to the constraints on the number of edges. It uses numerous options to allow further constraining of the output.