Factor-Critical Graphs with Given Number of Maximum Matchings

摘要

A connected graph G is said to be factor-critical if G ? ν has a perfect matching for every vertex ν of G. In this paper, the factor-critical graphs G with |V(G)| maximum matchings and with |V(G)| + 1 ones are characterized, respectively. From this, some special bicritical graphs are characterized.