✦ LIBER ✦

Group Weighted Matchings in Bipartite Graphs

✍ Scribed by R. Aharoni; R. Meshulam; B. Wajnryb

Book ID: 110419944
Publisher: Springer
Year: 1995
Tongue: English
Weight: 340 KB
Volume: 4
Category: Article
ISSN: 0925-9899
DOI: 10.1023/a:1022433630971

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Coloured matchings in bipartite graphs

✍ Kathie Cameron 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 213 KB

A theorem of states that for every n x n (n ~> 3) complete bipartite graph G such that every edge is coloured and each colour is the colour of at most two edges, there is a perfect matching whose edges have distinct colours. We give an O(n 2) algorithm for finding such a perfect matching. We show t

Induced matchings in bipartite graphs

✍ R.J. Faudree; A. Gyárfas; R.H. Schelp; Zs. Tuza 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 454 KB

Perfect matchings in regular bipartite g

Perfect matchings in regular bipartite graphs

✍ P. Katerinis; N. Tsikopoulos 📂 Article 📅 1996 🏛 Springer Japan 🌐 English ⚖ 356 KB

On maximum induced matchings in bipartit

On maximum induced matchings in bipartite graphs

✍ V.V. Lozin 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 75 KB

ACYCLIC MATCHINGS IN SUBCLASSES OF BIPAR

ACYCLIC MATCHINGS IN SUBCLASSES OF BIPARTITE GRAPHS

✍ PANDA, B. S.; PRADHAN, D. 📂 Article 📅 2012 🏛 World Scientific 🌐 English ⚖ 314 KB

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.