✦ LIBER ✦

Some Results on Matching in Bipartite Graphs

✍ Scribed by R. L. Graham and L. H. Harper

Book ID: 124874110
Publisher: Society for Industrial and Applied Mathematics
Year: 1969
Tongue: English
Weight: 441 KB
Volume: 17
Category: Article
ISSN: 0036-1399
DOI: 10.2307/2099179

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Some Results on Matching in Bipartite Gr

Some Results on Matching in Bipartite Graphs

✍ Graham, R. L.; Harper, L. H. 📂 Article 📅 1969 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 462 KB

New results on maximum induced matchings

New results on maximum induced matchings in bipartite graphs and beyond

✍ Dabrowski, Konrad K.; Demange, Marc; Lozin, Vadim V. 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 515 KB

Some Recent Results on Graph Matching

✍ LÁSZLÓ LOVÁSZ; MICHAEL D. PLUMMER 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 542 KB

Some results on λ-valuation of graphs in

Some results on λ-valuation of graphs involving complete bipartite graphs

✍ Sze-Chin Shee 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 389 KB

Shee, S.-C., Some results on I-valuation of graphs involving complete bipartite graphs, Discrete Mathematics 87 (1991) 73-80. In this paper we show that a graph G obtained from a complete bipartite graph K,,, and a collection of q (cmax{m, n}) stars G, by joining the centre of G, to every vertex of

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