{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T00:43:10Z","timestamp":1759624990610,"version":"build-2065373602"},"reference-count":20,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2025,6,1]],"date-time":"2025-06-01T00:00:00Z","timestamp":1748736000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2025,6,1]],"date-time":"2025-06-01T00:00:00Z","timestamp":1748736000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2025,6,1]],"date-time":"2025-06-01T00:00:00Z","timestamp":1748736000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2025,6,1]],"date-time":"2025-06-01T00:00:00Z","timestamp":1748736000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2025,6,1]],"date-time":"2025-06-01T00:00:00Z","timestamp":1748736000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2025,6,1]],"date-time":"2025-06-01T00:00:00Z","timestamp":1748736000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,6,1]],"date-time":"2025-06-01T00:00:00Z","timestamp":1748736000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11871239","11971196"],"award-info":[{"award-number":["11871239","11971196"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Applied Mathematics and Computation"],"published-print":{"date-parts":[[2025,6]]},"DOI":"10.1016\/j.amc.2025.129300","type":"journal-article","created":{"date-parts":[[2025,1,17]],"date-time":"2025-01-17T15:47:49Z","timestamp":1737128869000},"page":"129300","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["A Fan-type condition for cycles in 1-tough and k-connected (P2\u202f\u222a\u202fkP1)-free graphs"],"prefix":"10.1016","volume":"494","author":[{"given":"Zhiquan","family":"Hu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jie","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0964-3809","authenticated-orcid":false,"given":"Changlong","family":"Shen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"1","key":"10.1016\/j.amc.2025.129300_br0010","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s00373-006-0649-0","article-title":"Toughness in graphs-A survey","volume":"22","author":"Bauer","year":"2006","journal-title":"Graphs Comb."},{"issue":"3","key":"10.1016\/j.amc.2025.129300_br0020","doi-asserted-by":"crossref","first-page":"244","DOI":"10.1002\/jgt.21734","article-title":"On toughness and hamiltonicity of 2K2-free graphs","volume":"75","author":"Broersma","year":"2014","journal-title":"J. Graph Theory"},{"key":"10.1016\/j.amc.2025.129300_br0030","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1002\/(SICI)1097-0118(199604)21:4<431::AID-JGT9>3.0.CO;2-Q","article-title":"Toughness and Hamiltonicity in almost claw-free graphs","volume":"21","author":"Broersma","year":"1996","journal-title":"J. Graph Theory"},{"key":"10.1016\/j.amc.2025.129300_br0040","doi-asserted-by":"crossref","first-page":"832","DOI":"10.1016\/j.disc.2005.11.051","article-title":"Toughness and Hamiltonicity in k-trees","volume":"307","author":"Broersma","year":"2007","journal-title":"Discrete Math."},{"key":"10.1016\/j.amc.2025.129300_br0050","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1002\/(SICI)1097-0037(199801)31:1<29::AID-NET4>3.0.CO;2-M","article-title":"Tough enough chordal graphs are Hamiltonian","volume":"31","author":"Chen","year":"1998","journal-title":"Networks"},{"key":"10.1016\/j.amc.2025.129300_br0060","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/0012-365X(73)90138-6","article-title":"Tough graphs and Hamilton circuits","volume":"5","author":"Chv\u00e1tal","year":"1973","journal-title":"Discrete Math."},{"key":"10.1016\/j.amc.2025.129300_br0070","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1016\/0012-365X(72)90079-9","article-title":"A note on Hamilton circuits","volume":"2","author":"Chv\u00e1tal","year":"1972","journal-title":"Discrete Math."},{"key":"10.1016\/j.amc.2025.129300_br0080","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/0012-365X(95)00359-5","article-title":"1-tough cocomparability graphs are hamiltonicity","volume":"170","author":"Deogun","year":"1997","journal-title":"Discrete Math."},{"key":"10.1016\/j.amc.2025.129300_br0090","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1016\/0095-8956(84)90054-6","article-title":"New sufficient conditions for cycles in graphs","volume":"37","author":"Fan","year":"1984","journal-title":"J. Comb. Theory, Ser. B"},{"key":"10.1016\/j.amc.2025.129300_br0100","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1016\/j.disc.2003.11.046","article-title":"Toughness and Hamiltonicity of a class of planar graphs","volume":"286","author":"Gerlach","year":"2004","journal-title":"Discrete Math."},{"author":"Hatfield","key":"10.1016\/j.amc.2025.129300_br0110"},{"key":"10.1016\/j.amc.2025.129300_br0120","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1016\/j.jctb.2016.07.002","article-title":"10-tough chordal graphs are Hamiltonian","volume":"122","author":"Kabela","year":"2017","journal-title":"J. Comb. Theory, Ser. B"},{"issue":"4","key":"10.1016\/j.amc.2025.129300_br0130","doi-asserted-by":"crossref","first-page":"915","DOI":"10.7151\/dmgt.1897","article-title":"Forbidden subgraphs for hamiltonicity of 1-tough graphs","volume":"36","author":"Li","year":"2016","journal-title":"Discuss. Math., Graph Theory"},{"key":"10.1016\/j.amc.2025.129300_br0140","doi-asserted-by":"crossref","DOI":"10.1155\/2013\/673971","article-title":"Disconnected forbidden subgraphs, toughness and Hamilton cycles","volume":"2013","author":"Nikoghosyan","year":"2013","journal-title":"ISRN Combin."},{"issue":"4","key":"10.1016\/j.amc.2025.129300_br0150","doi-asserted-by":"crossref","first-page":"769","DOI":"10.1002\/jgt.22852","article-title":"Hamiltonian cycles in 2-tough 2K2-free graphs","volume":"101","author":"Ota","year":"2022","journal-title":"J. Graph Theory"},{"key":"10.1016\/j.amc.2025.129300_br0160","doi-asserted-by":"crossref","DOI":"10.1016\/j.disc.2023.113841","article-title":"Some conditions for hamiltonian cycles in 1-tough (K2\u222akK1) free graphs","volume":"347","author":"Ota","year":"2024","journal-title":"Discrete Math."},{"issue":"3","key":"10.1016\/j.amc.2025.129300_br0170","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1002\/jgt.22526","article-title":"Hamiltonian cycles in 3-tough 2K2-free graphs","volume":"94","author":"Shan","year":"2020","journal-title":"J. Graph Theory"},{"issue":"1","key":"10.1016\/j.amc.2025.129300_br0180","doi-asserted-by":"crossref","first-page":"1.36","DOI":"10.37236\/8657","article-title":"Hamiltonian cycles in tough (P2\u222aP3)-free graphs","volume":"28","author":"Shan","year":"2021","journal-title":"Electron. J. Comb."},{"key":"10.1016\/j.amc.2025.129300_br0190","doi-asserted-by":"crossref","DOI":"10.1016\/j.disc.2022.113081","article-title":"A note on hamiltonian cycles in 4-tough (P2\u222akP1)-free graphs","volume":"345","author":"Shi","year":"2022","journal-title":"Discrete Math."},{"key":"10.1016\/j.amc.2025.129300_br0200","doi-asserted-by":"crossref","DOI":"10.1016\/j.disc.2023.113755","article-title":"Hamiltonicity of 1-tough (P2\u222akP1)-free graphs","volume":"347","author":"Xu","year":"2024","journal-title":"Discrete Math."}],"container-title":["Applied Mathematics and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S009630032500027X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S009630032500027X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,4]],"date-time":"2025-10-04T15:33:00Z","timestamp":1759591980000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S009630032500027X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6]]},"references-count":20,"alternative-id":["S009630032500027X"],"URL":"https:\/\/doi.org\/10.1016\/j.amc.2025.129300","relation":{},"ISSN":["0096-3003"],"issn-type":[{"type":"print","value":"0096-3003"}],"subject":[],"published":{"date-parts":[[2025,6]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A Fan-type condition for cycles in 1-tough and k-connected (P2\u202f\u222a\u202fkP1)-free graphs","name":"articletitle","label":"Article Title"},{"value":"Applied Mathematics and Computation","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.amc.2025.129300","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2025 Elsevier Inc. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"129300"}}