✦ LIBER ✦

A characterization of graphs that ensure the existence of stable matchings

✍ Scribed by Hernán Abeledo; Garth Isaak

Publisher: Elsevier Science
Year: 1991
Tongue: English
Weight: 261 KB
Volume: 22
Category: Article
ISSN: 0165-4896
DOI: 10.1016/0165-4896(91)90069-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Characterization of stable matchings as

Characterization of stable matchings as extreme points of a polytope

✍ Uriel G. Rothblum 📂 Article 📅 1992 🏛 Springer-Verlag 🌐 English ⚖ 628 KB

Ensuring the existence of a BCNF- decomp

Ensuring the existence of a BCNF- decomposition that preserves functional dependencies in O(N2) time

✍ Mila E. Majster-Cederbaum 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 531 KB

A note on the decomposition of graphs in

A note on the decomposition of graphs into isomorphic matchings

✍ N. Alon 📂 Article 📅 1983 🏛 Akadmiai Kiad 🌐 English ⚖ 125 KB

A note on the number of perfect matching

A note on the number of perfect matchings of bipartite graphs

✍ Zhang Fuji; Zhang Heping 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 484 KB

Let G be a bipartite graph with 2n vertices, A its adjacency matrix and K the number of perfect matchings. For plane bipartite graphs each interior face of which is surrounded by a circuit of length 4s + 2, s E { 1,2,. . .}, an elegant formula, i.e. det A = (-1 )nK2, had been rigorously proved by Cv

The matching polynomial of a regular gra

The matching polynomial of a regular graph

✍ Robert A. Beezer; E.J. Farrell 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 588 KB

The matching polynomial of a graph has coefficients that give the number ofmatchings in the graph. For a regular graph, we show it is possible to recover the order, degree, girth and number of minimal cycles from the matching polynomial. If a graph is characterized by its matching polynomial, then i

The 2-matching lattice of a graph

✍ Dieter Jungnickel; Matthias Leclerc 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 135 KB