{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T22:08:39Z","timestamp":1740175719870,"version":"3.37.3"},"reference-count":27,"publisher":"Informa UK Limited","issue":"2","license":[{"start":{"date-parts":[[2024,2,26]],"date-time":"2024-02-26T00:00:00Z","timestamp":1708905600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100004608","name":"Natural Science Foundation of Jiangsu Province","doi-asserted-by":"publisher","award":["BK20230388"],"award-info":[{"award-number":["BK20230388"]}],"id":[{"id":"10.13039\/501100004608","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12301441"],"award-info":[{"award-number":["12301441"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["www.tandfonline.com"],"crossmark-restriction":true},"short-container-title":["AKCE International Journal of Graphs and Combinatorics"],"published-print":{"date-parts":[[2024,5,3]]},"DOI":"10.1080\/09728600.2024.2314512","type":"journal-article","created":{"date-parts":[[2024,2,26]],"date-time":"2024-02-26T10:37:53Z","timestamp":1708943873000},"page":"167-170","update-policy":"https:\/\/doi.org\/10.1080\/tandf_crossmark_01","source":"Crossref","is-referenced-by-count":0,"title":["Tight toughness bounds for path-factor critical avoidable graphs"],"prefix":"10.1080","volume":"21","author":[{"given":"Wenqi","family":"Wang","sequence":"first","affiliation":[{"name":"School of Mathematical Science &amp; Institute of Mathematics, Nanjing Normal University, Nanjing, Jiangsu, P.R. China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guowei","family":"Dai","sequence":"additional","affiliation":[{"name":"School of Mathematical Science &amp; Institute of Mathematics, Nanjing Normal University, Nanjing, Jiangsu, P.R. China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"301","published-online":{"date-parts":[[2024,2,26]]},"reference":[{"key":"e_1_3_1_2_1","first-page":"1","volume-title":"Lecture Notes in Mathematics","author":"Akiyama J.","year":"2011","unstructured":"Akiyama, J., Kano, M. (2011). Factors and Factorizations of Graphs. Lecture Notes in Mathematics, Vol. 2031. Berlin: Springer, pp. 1\u2013347."},{"key":"e_1_3_1_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0012-365X(01)00214-X"},{"key":"e_1_3_1_4_1","volume-title":"Graph Theory with Applications","author":"Bondy J. A.","year":"1982","unstructured":"Bondy, J. A., Murty, U. S. R. (1982). Graph Theory with Applications. NewYork-Amsterdam-Oxford: North-Holland."},{"key":"e_1_3_1_5_1","doi-asserted-by":"publisher","DOI":"10.1080\/09728600.2022.2094299"},{"key":"e_1_3_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(73)90138-6"},{"key":"e_1_3_1_7_1","doi-asserted-by":"publisher","DOI":"10.1051\/ro\/2022033"},{"key":"e_1_3_1_8_1","doi-asserted-by":"publisher","DOI":"10.7151\/dmgt.2353"},{"key":"e_1_3_1_9_1","doi-asserted-by":"publisher","DOI":"10.1051\/ro\/2022112"},{"key":"e_1_3_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00373-020-02184-7"},{"key":"e_1_3_1_11_1","doi-asserted-by":"publisher","DOI":"10.1051\/ro\/2021140"},{"key":"e_1_3_1_12_1","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.22253"},{"key":"e_1_3_1_13_1","doi-asserted-by":"publisher","DOI":"10.1002\/1097-0118(200104)36:4<175::AID-JGT1005>3.0.CO;2-T"},{"key":"e_1_3_1_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0095-8956(03)00027-3"},{"key":"e_1_3_1_15_1","doi-asserted-by":"publisher","DOI":"10.7151\/dmgt.1426"},{"issue":"1","key":"e_1_3_1_16_1","first-page":"25","article-title":"Binding number for path-factor uniform graphs","volume":"23","author":"Liu H","year":"2022","unstructured":"Liu, H (2022). Binding number for path-factor uniform graphs. Proc. Romanian Acad. Ser. A: Math. Phys. Techn. Sci. Inf. Sci. 23(1): 25\u201332.","journal-title":"Proc. Romanian Acad. Ser. A: Math. Phys. Techn. Sci. Inf. Sci"},{"key":"e_1_3_1_17_1","doi-asserted-by":"publisher","DOI":"10.4153\/CJM-1952-028-2"},{"key":"e_1_3_1_18_1","doi-asserted-by":"publisher","DOI":"10.1051\/ro\/2022123"},{"key":"e_1_3_1_19_1","doi-asserted-by":"publisher","DOI":"10.1051\/ro\/2022208"},{"key":"e_1_3_1_20_1","first-page":"385","article-title":"Fractional (g, f)-factors in graphs","volume":"16","author":"Yang J.","year":"2001","unstructured":"Yang, J., Ma, Y., Liu, G. (2001). Fractional (g, f)-factors in graphs. Appl. Math. J. Chinese Univ. Ser. A. 16: 385\u2013390.","journal-title":"Appl. Math. J. Chinese Univ. Ser. A"},{"key":"e_1_3_1_21_1","first-page":"211","article-title":"On tree-factor covered graphs","volume":"2","author":"Yu Q.","year":"1987","unstructured":"Yu, Q., Chen, C. (1987). On tree-factor covered graphs. J. Combin. Math. Combin. Comput. 2: 211\u2013218.","journal-title":"J. Combin. Math. Combin. Comput"},{"key":"e_1_3_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-93952-8"},{"key":"e_1_3_1_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2008.04.022"},{"key":"e_1_3_1_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10255-022-1096-2"},{"key":"e_1_3_1_25_1","doi-asserted-by":"publisher","DOI":"10.7151\/dmgt.2364"},{"key":"e_1_3_1_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00010-021-00852-4"},{"key":"e_1_3_1_27_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0004972721000952"},{"key":"e_1_3_1_28_1","doi-asserted-by":"publisher","DOI":"10.7151\/dmgt.1974"}],"container-title":["AKCE International Journal of Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.tandfonline.com\/doi\/pdf\/10.1080\/09728600.2024.2314512","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,19]],"date-time":"2024-09-19T16:41:58Z","timestamp":1726764118000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.tandfonline.com\/doi\/full\/10.1080\/09728600.2024.2314512"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,2,26]]},"references-count":27,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2024,5,3]]}},"alternative-id":["10.1080\/09728600.2024.2314512"],"URL":"https:\/\/doi.org\/10.1080\/09728600.2024.2314512","relation":{},"ISSN":["0972-8600","2543-3474"],"issn-type":[{"type":"print","value":"0972-8600"},{"type":"electronic","value":"2543-3474"}],"subject":[],"published":{"date-parts":[[2024,2,26]]},"assertion":[{"value":"The publishing and review policy for this title is described in its Aims & Scope.","order":1,"name":"peerreview_statement","label":"Peer Review Statement"},{"value":"http:\/\/www.tandfonline.com\/action\/journalInformation?show=aimsScope&journalCode=uakc20","URL":"http:\/\/www.tandfonline.com\/action\/journalInformation?show=aimsScope&journalCode=uakc20","order":2,"name":"aims_and_scope_url","label":"Aim & Scope"},{"value":"2022-10-12","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2024-01-18","order":1,"name":"revised","label":"Revised","group":{"name":"publication_history","label":"Publication History"}},{"value":"2024-01-29","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2024-02-26","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}