The Characterization of p-factor-critical Graphs

作     者：Shao-hui ZHAI Er-ling WEI Fu-ji ZHANG Shao-hui ZHAI;Er-ling WEI;Fu-ji ZHANG

作者机构：School of Applied MathematicsXiamen University of TechnologyXiamen 361024China School of MathematicsRenmin University of ChinaBeijing 100872China School of Mathematical SciencesXiamen UniversityXiamen 361005China 

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

年 卷 期：2022年第38卷第1期

页      面：154-158页

核心收录：

学科分类：07[理学] 070104[理学-应用数学] 0701[理学-数学] 

基　　金：Supported by the National Natural Science Foundation of China(No.11401576) 

主　　题：perfect matching,p-factor-critical graph transversal 

摘      要：A graph G is said to be p-factor-critical if G-u1-u2-···-up has a perfect matching for any u1,u2,···,up∈V(G).The concept of p-factor-critical is a generalization of the concepts of factor-critical and bicritical for p=1 and p=2,*** Zhang and Fuji Zhang[Construction for bicritical graphs and k-extendable bipartite graphs,Discrete Math.,306(2006)1415–1423]gave a concise structure characterization of bicritical *** this paper,we present the characterizations of p-factor-critical graphs and minimal p-factorcritical graphs for p≥*** an application,we also obtain a class of graphs which are minimal p-factor-critical for p≥1.