On the equivalence in complexity among basic problems on bipartite and parity graphs