具有|V(G)|+2个最大匹配的因子临界图G

Factor-critical Graph G with |V(G)|+2 Maximum Matchings

在连通图G中,如果对任意的v∈V(G),G-v有完美匹配,则称G是因子临界图.该文刻画了具有|V(G)|+2个最大匹配的因子临界图.进而,刻画了一些特殊的双因子临界图.

A connected graph G is said to be factor-critical if G - v has a perfect matching for every vertex v of G. In this paper, the factor-critical graph G with ｜V（G）｜ ＋ 2 maximum matchings is characterized. By this, some special bicritical graphs are characterized.