Two sufficient conditions for the existence of path factors in graphs
Sizhong Zhou, Fan Yang, Lan Xu · Scientia Iranica · 2018
A graph G is called a (P n ; k)-factor critical graph if G U has a P n -factor for any U V (G) with jUj = k.A graph G is called a (P n ; m)-factor deleted graph if G E 0 contains a P n -factor for any E 0 E(G) with jE 0 j = m.In this paper, we obtain two results for graphs to be (P n ; k)-factor critical graphs or (P n ; m)-factor deleted graphs.The two results are best possible in some conditions.