P30: Enumerate well-ordered (strongly) $k$-generate with $n$ vertices

P30: Enumerate well-ordered (strongly) $k$-generate with $n$ vertices

Input:

$n$: the number of vertices.

Output:

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

Complexity:

$O(nm+m^2)$ time per enumerated and printed graph.

Comment:

$m$ is the number of edges of printed graphs.

Reference:

[Bauer2010a] (Bibtex)