Perfect Matching Preservers

For two bipartite graphs G and G 0, a bijection : E(G) ! E(G 0 is called a (perfect) matching preserver provided that M is a perfect matching in G if and only if (M) is a perfect matching in G