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
- DOI
- 10.1137/0117090
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
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
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