On the Equivalence in Complexity among Basic Problems on Bipartite and Parity Graphs