K − Bipartite Matching Extendability of Special Graphs

Let be a simple connected graph containing a perfect matching. For a positive integer , , is said to be bipartite matching extendable if every bipartite matching of with is included in a perfect matching of . In this paper, we show that bipartite matching extendability of some special graphs.