On uniqueness of prime bipartite factors of graphs

To accomplish this, we prove the following preliminary result, which is the main technical result of the paper: Suppose A×B is connected and bipartite, and B is the bipartite factor. If A×B admits an involution that reverses partite sets, then B also admits such an involution.