Nodes, cycles and paths

Below is an undirected graph:

What is the number of cycles in the graph that include the nodes $0$ and $1$? Print all these cycles in the field below. For example, your output may look like this:

0 3 4 1 0
0 5 2 1 0

Take the following restrictions into account:

• All cycles should be simple.
• Each cycle should start and end with the node $0$.
• Cycles with reversed order of nodes are the same. For example, $0-1-2-0$ and $0-2-1-0$ are the same cycles.