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.

• 称G是偶匹配可扩的，如果G中导出子图是偶图的匹配对都可以扩充为G的完美匹配。