2-Connected Factor-critical Graphs G with Exactly ｜E(G)｜ ＋ 1 Maximum Matchings

作     者：Ming-hua LI Yan LIU 

作者机构：School of Mathematical Sciences South China Normal University Guangzhou 510631 China 

出 版 物：《Acta Mathematicae Applicatae Sinica》 (应用数学学报（英文版）)

年 卷 期：2017年第33卷第4期

页      面：1001-1014页

核心收录：

学科分类：07[理学] 070104[理学-应用数学] 0701[理学-数学] 0812[工学-计算机科学与技术（可授工学、理学学位）] 

基　　金：supported by the National Natural Science Foundation of China(No.11551003) the Scientific research fund of the Science and Technology Program of Guangzhou,China(No.201510010265) the Qinghai Province Natural Science Foundation(No.2015-ZJ-911) 

主　　题：maximum matching factor-critical graph 2-connected graph 

摘      要：A connected graph G is said to be a factor-critical graph if G - v has a perfect matching for every vertex v of G. In this paper, the 2-connected factor-critical graph G which has exactly ｜E（G）｜＋ 1 maximum matchings is characterized.