典型文献
The Characterization ofp-factor-critical Graphs
文献摘要：
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,respectively.Heping 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 graphs.In this paper,we present the characterizations of p-factor-critical graphs and minimal p-factor-critical graphs for p≥2.As an application,we also obtain a class of graphs which are minimal p-factor-critical for p≥1.
文献关键词：
中图分类号：
作者姓名：
Shao-hui ZHAI;Er-ling WEI;Fu-ji ZHANG
作者机构：
School of Applied Mathematics,Xiamen University of Technology,Xiamen 361024,China;School of Mathematics,Renmin University of China,Beijing 100872,China;School of Mathematical Sciences,Xiamen University,Xiamen 361005,China
文献出处：
引用格式：
[1]Shao-hui ZHAI;Er-ling WEI;Fu-ji ZHANG-.The Characterization ofp-factor-critical Graphs)[J].应用数学学报（英文版）,2022(01):154-158
A类：
ofp,bicritical,Heping
B类：
Characterization,Graphs,said,be,if,u1,u2,up,has,perfect,matching,any,generalization,concepts,respectively,Zhang,Fuji,Construction,graphs,extendable,bipartite,Discrete,Math,gave,concise,structure,In,this,paper,we,present,characterizations,minimal,application,also,obtain,class,which,are
AB值：
0.472158
相似文献
机标中图分类号，由域田数据科技根据网络公开资料自动分析生成，仅供学习研究参考。
