A characterization of graphs that ensure the existence of stable matchings (Q1181746)

From MaRDI portal
Revision as of 16:58, 14 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
A characterization of graphs that ensure the existence of stable matchings
scientific article

    Statements

    A characterization of graphs that ensure the existence of stable matchings (English)
    0 references
    0 references
    0 references
    27 June 1992
    0 references
    0 references
    stable marriage
    0 references
    bipartite acceptability graph
    0 references
    stable matching
    0 references