P244: Enumeration of all small cycles in a graph

P244: Enumeration of all small cycles in a graph

Input:

A graph $G$.

Output:

All cycles with length at most $5$ in $G$.

Complexity:

Comment:

Reference:

[Wild2008] (Bibtex)