G is said to be bipartite matching extendable (BM-extendable) if every matching M whose induced subgraph is a bipartite graph extends to a perfect matching of G.