Geodesic
Perfect matching preservers
The electronic journal of combinatorics, Tome 13 (2006)

Voir la notice de l'article provenant de la source The Electronic Journal of Combinatorics website

Zbl EuDML
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.
DOI : 10.37236/1121
Classification : 05C70, 05C20, 05C50 
Richard A. Brualdi; Martin Loebl; Ondřej Pangrác. Perfect matching preservers. The electronic journal of combinatorics, Tome 13 (2006). doi: 10.37236/1121
@article{10_37236_1121,
     author = {Richard A. Brualdi and Martin Loebl and Ond\v{r}ej Pangr\'ac},
     title = {Perfect matching preservers},
     journal = {The electronic journal of combinatorics},
     year = {2006},
     volume = {13},
     doi = {10.37236/1121},
     zbl = {1115.05069},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/1121/}
}
TY  - JOUR
AU  - Richard A. Brualdi
AU  - Martin Loebl
AU  - Ondřej Pangrác
TI  - Perfect matching preservers
JO  - The electronic journal of combinatorics
PY  - 2006
VL  - 13
UR  - http://geodesic.mathdoc.fr/articles/10.37236/1121/
DO  - 10.37236/1121
ID  - 10_37236_1121
ER  - 
%0 Journal Article
%A Richard A. Brualdi
%A Martin Loebl
%A Ondřej Pangrác
%T Perfect matching preservers
%J The electronic journal of combinatorics
%D 2006
%V 13
%U http://geodesic.mathdoc.fr/articles/10.37236/1121/
%R 10.37236/1121
%F 10_37236_1121

Cité par Sources :