P122: Enumeration of all the edge colorings in a bipartite graph

P122: Enumeration of all the edge colorings in a bipartite graph

Input:

A bipartite graph $G = (V, E)$.

Output:

All edge colorings in $G$.

Complexity:

$O(\Delta|E|)$ time per solution and space.

Comment:

$\Delta$ is the maximum degree in $G$.

Reference:

[Yasuko1994] (Bibtex)