Two sufficient conditions for the existence of path factors in graphs

Abstract

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|U|=k. A graphG is called a (P≥n, m)-factor deleted graph if.............