Perfect Matching Preservers
For two bipartite graphs $G$ and $G'$, a bijection $\psi: E(G) \rightarrow E(G')$ is called a (perfect) matching preserver provided that $M$ is a perfect matching in $G$ if and only if $\psi(M)$ is a perfect matching in $G'$. We characterize bipartite graphs $G$ and $G'$ which are related by a matching preserver and the matching preservers between them.
2013 ◽
Vol 22
(5)
◽
pp. 783-799
◽
2012 ◽
Vol 78
(3)
◽
pp. 765-779
◽
Keyword(s):
2012 ◽
Vol 4
(20)
◽
pp. 259-267
2005 ◽
Vol 96
(3)
◽
pp. 81-88
◽