G is said to be bipartite matching extendable if every matching M whose induced subgraph is a bipartite matching extends to a perfect matching.

• 称图G是偶匹配可扩的,是指G的每一个偶匹配都可以扩充成为G的一个完美匹配。