Extendibility for the Matching of Bipartite Graphs
Hong Li · Journal of Chengdu University · 2003
G is a connected bipartite graph with bipartition (X,Y,Z). In this paper we prove mainly that if G satisfies |X|=|Y|, δ(G)≥2n+1(1≤n≤|X|2,n∈N),and d(u)+d(v)≥|X|+2n for each pair of vertices u. v whose distance is 3, then Gis 2n- extendable.