K-Bipartite Matching Extendability of Special Graphs

摘要：

　　Let G be a simple connected graph containing a perfect matching.For a positive integer k,l ≤ k ≤ (|V(G) |-2)/2,G is said to be k-bipartite matching extendable if every bipartite matching of G with | M |≤ k is included in a perfect matching of G.In this paper,we show that k-bipartite matching extendability of some special graphs.

关键词： bipartite matching bipartite matching extendable k-bipartite matching extendable

作者: Zhihao Hui Jinwei Yang Biao Zhao

作者单位: College of Mathematics and Information Sciences, Pingdingshan University,Pingdingshan, 467000, China College of Mathematics and System Sciences, Xinjiang University, Urumqi, 830046,China

会议类型: 国际会议

会议名称: the Second International Conference on Frontiers of Manufacturing and Design Science(第二届制造与设计科学国际会议(ICFMD 2011))

会议地点: 台湾

会议语种:英文

页码: 4008-4012

在线出版日期: 2011-12-11（万方平台首次上网日期，不代表论文的发表时间）