On P≥3-factor Deleted Graphs

作     者：Si-zhong ZHOU Zhi-ren SUN Hong-xia LIU Si-zhong ZHOU;Zhi-ren SUN;Hong-xia LIU

作者机构：School of ScienceJiangsu University of Science and TechnologyZhenjiang 212100China School of Mathematical SciencesNanjing Normal UniversityNanjing 210023China School of Mathematics and Information SciencesYantai UniversityYantai 264005China 

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

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

页      面：178-186页

核心收录：

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

基　　金：supported by Six Talent Peaks Project in Jiangsu Province China(Grant No.JY–022) 

主　　题：toughness isolated toughness connectivity P≥3-factor P≥3-factor deleted graph 

摘      要：A spanning subgraph F of a graph G is called a path factor of G if each component of F is a path.A P≥k-factor means a path factor with each component having at least k vertices,where k≥2 is an ***,Benhamdine,Li and Wozniak[***,***,***,***,Partitioning vertices of 1-tough graph into paths,***.263(2001)255–261.]obtained a toughness condition for a graph to have a P≥*** introduce the concept of a P≥k-factor deleted graph,that is,if a graph G has a P≥k-factor excluding e for every e∈E(G),then we say that G is a P≥k-factor deleted *** this paper,we show four sufficient conditions for a graph to be a P≥3-factor deleted ***,it is shown that four results are best possible in some sense.