P31: Enumerate well-ordered (strongly) $k$-generate with $n$ vertices and $m$ edges

P31: Enumerate well-ordered (strongly) $k$-generate with $n$ vertices and $m$ edges

Input:

$n$: the number of vertices, $m$: the number of edges.

Output:

All well-ordered (strongly) $k$-degenerate graphs with $n$ vertices and $m$ edges.

Complexity:

$O(n^{3/2}m^2)$ time per enumerated and printed graph.

Comment:

Reference:

[Bauer2010a] (Bibtex)