๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Some Results on Matching in Bipartite Graphs

โœ Scribed by Graham, R. L.; Harper, L. H.


Book ID
118191715
Publisher
Society for Industrial and Applied Mathematics
Year
1969
Tongue
English
Weight
462 KB
Volume
17
Category
Article
ISSN
0036-1399

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


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
โœ 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
On some weakly bipartite graphs
โœ Francisco Barahona ๐Ÿ“‚ Article ๐Ÿ“… 1983 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 396 KB