Name
Abstract | ||
|---|---|---|
For two bipartite graphs G and G', a bijection psi: E(G) --> 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. |
Year | Venue | Keywords |
|---|---|---|
2006 | ELECTRONIC JOURNAL OF COMBINATORICS | bipartite graph |
Field | DocType | Volume |
Discrete mathematics,Combinatorics,Bijection,Bipartite graph,Matching (graph theory),If and only if,Mathematics | Journal | 13 |
Issue | ISSN | Citations |
1.0 | 1077-8926 | 0 |
PageRank | References | Authors |
0.34 | 3 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Richard A. Brualdi | 1 | 389 | 95.40 |
| Martin Loebl | 2 | 152 | 28.66 |
| Ondřej Pangrác | 3 | 50 | 8.94 |