k-Bipartite Matching Extendibility of Harary Graph
Yu Fen Yang · Luoyang Shifan Xueyuan xuebao · 2011
Let G be a simple connected graph containing a perfect matching.G is said to be k-bipartite matching extendable,if every bipartite matching M of G with |M|≤k is included in a perfect matching of G,where 1≤k≤(V(G)-2)2.This paper demonstrates that: For any positive integern,if r(r4) is even number,then Hr,2n is 2-bipartite matching extendable.