P87: Enumeration of all the edge colorings of a bipartite graph

P87: Enumeration of all the edge colorings of a bipartite graph

Input:

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

Output:

All the edge colorings pf $B$.

Complexity:

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

Comment:

Reference:

[Matsui1996a] (Bibtex)