典型文献
On P≥3-factor Deleted Graphs
文献摘要：
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 integer.Bazgan,Benhamdine,Li and Wozniak[C.Bazgan,A.H.Benhamdine,H.Li,M.Wozniak,Partitioning vertices of 1-tough graph into paths,Theoret.Comput.Sci.263(2001)255-261.]obtained a toughness condition for a graph to have a P≥3-factor.We 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 graph.In this paper,we show four sufficient conditions for a graph to be a P≥3-factor deleted graph.Furthermore,it is shown that four results are best possible in some sense.
文献关键词：
中图分类号：
作者姓名：
Si-zhong ZHOU;Zhi-ren SUN;Hong-xia LIU
作者机构：
School of Science,Jiangsu University of Science and Technology,Zhenjiang 212100,China;School of Mathematical Sciences,Nanjing Normal University,Nanjing 210023,China;School of Mathematics and Information Sciences,Yantai University,Yantai 264005,China
文献出处：
引用格式：
[1]Si-zhong ZHOU;Zhi-ren SUN;Hong-xia LIU-.On P≥3-factor Deleted Graphs)[J].应用数学学报（英文版）,2022(01):178-186
A类：
Deleted,Bazgan,Benhamdine,Wozniak,Theoret,Comput
B类：
On,Graphs,spanning,subgraph,called,if,each,component,means,having,least,vertices,where,integer,Li,Partitioning,into,paths,Sci,obtained,toughness,have,We,introduce,concept,deleted,that,has,excluding,every,then,we,say,In,this,paper,four,sufficient,conditions,Furthermore,shown,results,are,best,possible,some,sense
AB值：
0.429166
相似文献
机标中图分类号，由域田数据科技根据网络公开资料自动分析生成，仅供学习研究参考。
