Perfect matching preservers (Q870013)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Perfect matching preservers |
scientific article; zbMATH DE number 5132808
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Perfect matching preservers |
scientific article; zbMATH DE number 5132808 |
Statements
Perfect matching preservers (English)
0 references
12 March 2007
0 references
Summary: 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.
0 references
0.7458625435829163
0 references
0.7445917129516602
0 references
