Two sufficient conditions for the existence of path factors in graphs

Document Type: Article

Authors

1 School of Science, Jiangsu University of Science and Technology Mengxi Road 2, Zhenjiang, Jiangsu 212003, People's Republic of China

2 School of Science, Jiangsu University of Science and Technology, Zhenjiang, P. R. China

3 Department of Mathematics, Changji University, Changji, P. R. China

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.............

Keywords

Main Subjects