𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The labeled perfect matching in bipartite graphs

✍ Scribed by Jérôme Monnot

Book ID
108153428
Publisher
Elsevier Science
Year
2005
Tongue
English
Weight
148 KB
Volume
96
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Perfect matchings and ears in elementary
Perfect matchings and ears in elementary bipartite graphs
✍ Pierre Hansen; Fuji Zhang; Maolin Zheng 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 386 KB

We give lower and upper bounds for the number of reducible ears as well as upper bounds for the number of perfect matchings in an elementary bipartite graph. An application to chemical graphs is also discussed. In addition, a method to construct all minimal elementary bipartite graphs is described.

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