graph-enumeration is a library for the exhaustive generation of unique, undirected graphs with colored nodes. It generates all non-isomorphic connected graphs definable over a specific multiset of ...

# the largest rather than the smallest divisor. Hint: if y*z = x and y is # the smallest divisor of x, z is the largest divisor of x.