{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,2]],"date-time":"2026-06-02T13:58:06Z","timestamp":1780408686866,"version":"3.54.1"},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T00:00:00Z","timestamp":1605744000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T00:00:00Z","timestamp":1605744000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11971011"],"award-info":[{"award-number":["11971011"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11571135"],"award-info":[{"award-number":["11571135"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100013088","name":"Qinglan Project of Jiangsu Province of China","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100013088","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J. Appl. Math. Comput."],"published-print":{"date-parts":[[2021,6]]},"DOI":"10.1007\/s12190-020-01462-0","type":"journal-article","created":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T23:05:18Z","timestamp":1605827118000},"page":"809-821","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Toughness and isolated toughness conditions for $$P_{\\ge 3}$$-factor uniform graphs"],"prefix":"10.1007","volume":"66","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7152-466X","authenticated-orcid":false,"given":"Hongbo","family":"Hua","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2020,11,19]]},"reference":[{"key":"1462_CR1","first-page":"97","volume":"16","author":"J Akiyama","year":"1980","unstructured":"Akiyama, J., Avis, D., Era, H.: On a $$\\{1, 2\\}$$-factor of a graph. TRU Math. 16, 97\u2013102 (1980)","journal-title":"TRU Math."},{"key":"1462_CR2","doi-asserted-by":"crossref","unstructured":"Akiyama, J., Kano, M.: Path factors of a graph. In: F. Harary JS, Maybee (Eds.) Graphs and Applications, Proc. 1st Colorado Symposium on Graph Theory, Wiley, New York, 1982, pp. 1-21. (1985)","DOI":"10.1002\/jgt.3190090103"},{"key":"1462_CR3","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1016\/S0304-3975(00)00247-4","volume":"263","author":"C Bazgan","year":"2001","unstructured":"Bazgan, C., Benhamdine, A.H., Li, H., Wo\u017aniak, M.: Partitioning vertices of 1- tough graph into paths. Theoret. Comput. Sci. 263, 255\u2013261 (2001)","journal-title":"Theoret. Comput. Sci."},{"key":"1462_CR4","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1016\/0012-365X(73)90138-6","volume":"5","author":"V Chv\u00e1tal","year":"1973","unstructured":"Chv\u00e1tal, V.: Tough graphs and Hamiltonian circuits. Discret. Math. 5, 215\u2013228 (1973)","journal-title":"Discret. Math."},{"key":"1462_CR5","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1016\/S0095-8956(03)00027-3","volume":"88","author":"A Kaneko","year":"2003","unstructured":"Kaneko, A.: A necessary and sufficient condition for the existence of a path factor every component of which is a path of length at least two. J. Combin. Theory Ser. B 88, 195\u2013218 (2003)","journal-title":"J. Combin. Theory Ser. B"},{"key":"1462_CR6","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/j.disc.2004.01.016","volume":"283","author":"M Kano","year":"2004","unstructured":"Kano, M., Katona, G.Y., Kir\u00e1ly, Z.: Packing paths of length at least two. Discret. Math. 283, 129\u2013135 (2004)","journal-title":"Discret. Math."},{"key":"1462_CR7","first-page":"385","volume":"16","author":"J Yang","year":"2001","unstructured":"Yang, J., Ma, Y., Liu, G.: Fractional $$(g, f)$$-factors in graphs. Appl. Math. J. Chin. Univ. Ser. A 16, 385\u2013390 (2001)","journal-title":"Appl. Math. J. Chin. Univ. Ser. A"},{"key":"1462_CR8","doi-asserted-by":"publisher","first-page":"2067","DOI":"10.1016\/j.disc.2008.04.022","volume":"309","author":"H Zhang","year":"2009","unstructured":"Zhang, H., Zhou, S.: Characterizations for $$P_{\\ge 2}$$-factor and $$P_{\\ge 2}$$-factor covered graphs. Discret. Math. 309, 2067\u20132076 (2009)","journal-title":"Discret. Math."},{"key":"1462_CR9","doi-asserted-by":"publisher","first-page":"1055","DOI":"10.7151\/dmgt.1974","volume":"37","author":"S Zhou","year":"2017","unstructured":"Zhou, S., Wu, J., Zhang, T.: The existence of $$P_{\\ge 3}$$-factor covered graphs. Discuss. Math. Graph Theory 37, 1055\u20131065 (2017)","journal-title":"Discuss. Math. Graph Theory"},{"key":"1462_CR10","doi-asserted-by":"publisher","first-page":"111715","DOI":"10.1016\/j.disc.2019.111715","volume":"343","author":"S Zhou","year":"2020","unstructured":"Zhou, S., Sun, Z.: Binding number conditions for $$P_{\\ge 2}$$-factor and $$P_{\\ge 3}$$-factor uniform graphs. Discret. Math. 343, 111715 (2020)","journal-title":"Discret. Math."}],"container-title":["Journal of Applied Mathematics and Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12190-020-01462-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12190-020-01462-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12190-020-01462-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,11]],"date-time":"2021-05-11T17:49:06Z","timestamp":1620755346000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12190-020-01462-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,11,19]]},"references-count":10,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2021,6]]}},"alternative-id":["1462"],"URL":"https:\/\/doi.org\/10.1007\/s12190-020-01462-0","relation":{},"ISSN":["1598-5865","1865-2085"],"issn-type":[{"value":"1598-5865","type":"print"},{"value":"1865-2085","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,11,19]]},"assertion":[{"value":"4 August 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 November 2020","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 November 2020","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 November 2020","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Compliance with ethical standards"}},{"value":"The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}