✦ LIBER ✦

ACYCLIC MATCHINGS IN SUBCLASSES OF BIPARTITE GRAPHS

✍ Scribed by PANDA, B. S.; PRADHAN, D.

Book ID: 118011290
Publisher: World Scientific
Year: 2012
Tongue: English
Weight: 314 KB
Volume: 04
Category: Article
ISSN: 1793-8309
DOI: 10.1142/s1793830912500504

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

Group Weighted Matchings in Bipartite Gr

Group Weighted Matchings in Bipartite Graphs

✍ R. Aharoni; R. Meshulam; B. Wajnryb 📂 Article 📅 1995 🏛 Springer 🌐 English ⚖ 340 KB

On maximum induced matchings in bipartit

On maximum induced matchings in bipartite graphs

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

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