无爪双临界偶匹配可扩图的结构(英文)

The structure of K3-free bicritical BM-extendable graphs

图G是有完美匹配的简单连通图.称图G是偶匹配可扩的,是指G的每一个偶匹配都可以扩充成为G的一个完美匹配.在本章中,我们得到若干无爪双临界偶匹配可扩图的结构性质。

Let G be a simple connected graph containing a perfect matching. G is said to be bipartite matching extendable if every matching M whose induced subgraph is a bipartite matching extends to a perfect matching. In the paper, we present some properties of K_3-free bicritical BMextendable graphs.