✦ LIBER ✦

Perfect matchings of a graph

✍ Scribed by Ian Anderson

Publisher: Elsevier Science
Year: 1971
Tongue: English
Weight: 179 KB
Volume: 10
Category: Article
ISSN: 0095-8956
DOI: 10.1016/0095-8956(71)90041-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Complementation Theorem for Perfect Ma

A Complementation Theorem for Perfect Matchings of Graphs Having a Cellular Completion

✍ Mihai Ciucu 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 589 KB

A cellular graph is a graph whose edges can be partitioned into 4-cycles (called cells) so that each vertex is contained in at most two cells. We present a ``Complementation Theorem'' for the number of matchings of certain subgraphs of cellular graphs. This generalizes the main result of M. Ciucu (J

Graphs with independent perfect matching

Graphs with independent perfect matchings

✍ Marcelo H. de Carvalho; Cláudio L. Lucchesi; U. S. R. Murty 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 241 KB

A graph with at least two vertices is matching covered if it is connected and each edge lies in some perfect matching. A matching covered graph G is extremal if the number of perfect matchings of G is equal to the dimension of the lattice spanned by the set of incidence

Special parity of perfect matchings in b

Special parity of perfect matchings in bipartite graphs

✍ Ron Aharoni; Rachel Manber; Bronislaw Wajnryb 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 527 KB

Let G be a bipartite graph in which every edge belongs to some perfect matching, and let D be a subset of its edge set. It is shown that M fl D has the same parity for every perfect matching M if and only if D is a cut, and equivalently if and only. if (G, D) is a balanced signed-graph. This gives n

A compactness result for perfect matchin

A compactness result for perfect matchings

✍ Norbert Polat 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 537 KB

We show that an infinite set system (V, ~g), for which ~ is a subspace of the vector space of all finite subsets of V, has a perfect matching if and only if every finite subset of V is covered by a matching of (V, ~).

Z-transformation graphs of perfect match

Z-transformation graphs of perfect matchings of hexagonal systems

✍ Zhang Fu-ji; Guo Xiao-feng; Chen Rong-si 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 599 KB

Enumeration of Perfect Matchings in Grap

Enumeration of Perfect Matchings in Graphs with Reflective Symmetry

✍ Mihai Ciucu 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 759 KB

A plane graph is called symmetric if it is invariant under the reflection across some straight line. We prove a result that expresses the number of perfect matchings of a large class of symmetric graphs in terms of the product of the number of matchings of two subgraphs. When the graph is also centr