A characterization of graphs that ensure the existence of stable matchings (Q1181746)
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: A characterization of graphs that ensure the existence of stable matchings |
scientific article; zbMATH DE number 28757
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A characterization of graphs that ensure the existence of stable matchings |
scientific article; zbMATH DE number 28757 |
Statements
A characterization of graphs that ensure the existence of stable matchings (English)
0 references
27 June 1992
0 references
stable marriage
0 references
bipartite acceptability graph
0 references
stable matching
0 references
