@article { author = {Zhou, S. and Yang, F. and Xu, L.}, title = {Two sufficient conditions for the existence of path factors in graphs}, journal = {Scientia Iranica}, volume = {26}, number = {Special Issue on machine learning, data analytics, and advanced optimization techniques...}, pages = {3510-3514}, year = {2019}, publisher = {Sharif University of Technology}, issn = {1026-3098}, eissn = {2345-3605}, doi = {10.24200/sci.2018.5151.1122}, 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 = {Network,P≥n-factor,(P≥n, m)-factor,deleted graph,(P≥n, k)-factor critical graph,toughness,connectivity}, url = {https://scientiairanica.sharif.edu/article_21010.html}, eprint = {https://scientiairanica.sharif.edu/article_21010_f105b9c43c729606aec01a75feb7596d.pdf} }