Given a graph $G$ which is bipartite and balanced and has unique perfect matching let $G^{e}$ be $G$ without edge $e$. Let $G\cup G_{\pi,\pi'}$ be union of $G$ and $G_{\pi,\pi'}$ where $G_{\pi,\pi'}$ is $G$ but having vertices of permuted by permutation $\pi,\pi'$ and an edge is in the union iff it is in either $G$ or its permutation.
NOTATION $\pi\in S_n$ permutes color $1$ vertices and $\pi′\in S_n$ color $2$ vertices. The graph $H=G_{\pi,\pi'}$ has new edge $(i,j)$ if $(\pi^{-1}(i),\pi'^{-1}(j))$ is an edge in $G$. Remember we are specifying union and so the new permuted graph is technically considered 'different' and so we can specify union.
Eg: Consider graph having two vertices of color $1$ and $2$ and edge is $(1,2)$ and $(1,1)$. The permutation $\pi$ flips $1$ and $2$ of color $1$. $G_{\pi,id}$ has edges $(2,2)$ and $(2,1)$.
Is there a statement similar to "If $e$ belongs to the unique perfect matching then it is true at every $\pi,\pi'$ satisfying $\pi\pi'^{-1}\neq id$ and $\pi^{-1}\pi'\neq id$ the graph $G^e\cup G^e_{\pi,\pi'}$ has a vertex which is not part of a cycle"?
Since union of perfect matchings in bipartite graphs is disjoint union of cycles the converse is correct. If the graph is not of unique perfect matching I think we can produce a counterexample.