Two sufficient conditions for the existence of path factors in graphs

نویسندگان
doi
10.24200/sci.2018.5151.1122
چکیده

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

کلیدواژه‌ها
S. Zhou1, F. Yang2, L. Xu3, Network, P≥n-factor, (P≥n, m)-factor, deleted graph, (P≥n, k)-factor critical graph, toughness, connectivity