{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,12]],"date-time":"2025-08-12T21:54:30Z","timestamp":1755035670611},"reference-count":9,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2013,7,31]],"date-time":"2013-07-31T00:00:00Z","timestamp":1375228800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2014,9]]},"DOI":"10.1007\/s00373-013-1344-6","type":"journal-article","created":{"date-parts":[[2013,7,30]],"date-time":"2013-07-30T06:20:13Z","timestamp":1375165213000},"page":"1099-1122","source":"Crossref","is-referenced-by-count":12,"title":["3-Connected {K 1,3, P 9}-Free Graphs are Hamiltonian-Connected"],"prefix":"10.1007","volume":"30","author":[{"given":"Qiuju","family":"Bian","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ronald J.","family":"Gould","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paul","family":"Horn","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Susan","family":"Janiszewski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Steven","family":"La Fleur","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paul","family":"Wrayno","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,7,31]]},"reference":[{"key":"1344_CR1","unstructured":"Bedrossian, P.: Forbidden subgraph and minimum degree conditions for Hamiltonicity. Ph.D. thesis, Memphis State University (1991)"},{"key":"1344_CR2","doi-asserted-by":"crossref","first-page":"104","DOI":"10.1002\/jgt.10034","volume":"40","author":"H. Broersma","year":"2002","unstructured":"Broersma H., Faudree R.J., Huck A., Trommel H., Veldman H.J.: Forbidden subgraphs that imply Hamiltonian connectedness. J. Graph Theory 40, 104\u2013119 (2002)","journal-title":"J. Graph Theory"},{"issue":"2","key":"1344_CR3","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1006\/jctb.1998.1871","volume":"75","author":"S. Brandt","year":"1999","unstructured":"Brandt S.: 9-connected claw-free graphs are Hamilton-connected. J. Comb. Theory Ser. B 75(2), 167\u2013173 (1999)","journal-title":"J. Comb. Theory Ser. B"},{"key":"1344_CR4","unstructured":"Chartrand, G., Lesniak, L.: Graphs & Digraphs, 3rd edn. Chapman & Hall, New York (1996)"},{"key":"1344_CR5","first-page":"25","volume":"29","author":"G. Chen","year":"2000","unstructured":"Chen G., Gould R.J.: Hamiltonian connected graphs involving forbidden subgraphs. Bull. I.C.A. 29, 25\u201332 (2000)","journal-title":"Bull. I.C.A."},{"key":"1344_CR6","unstructured":"Faudree, J.R., Faudree, R.J., Ryj\u00e1c\u0306ek, Z., Vr\u00e1na, P.: On forbidden pairs implying Hamilton-connectedness. Preprint (2010)"},{"key":"1344_CR7","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/S0012-365X(96)00147-1","volume":"173","author":"R.J. Faudree","year":"1997","unstructured":"Faudree R.J., Gould R.J.: Characterizing forbidden pairs for Hamiltonian properties. Discret. Math. 173, 45\u201360 (1997)","journal-title":"Discret. Math."},{"key":"1344_CR8","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1016\/S0012-365X(02)00573-3","volume":"271","author":"A. Kelmans","year":"2003","unstructured":"Kelmans A.: On graph closures. Discret. Math. 271, 141\u2013168 (2003)","journal-title":"Discret. Math."},{"key":"1344_CR9","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/0095-8956(91)90074-T","volume":"53","author":"F.B. Shepherd","year":"1991","unstructured":"Shepherd F.B.: Hamiltonicity in claw-free graphs. J. Comb. Theory (B) 53, 173\u2013194 (1991)","journal-title":"J. Comb. Theory (B)"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-013-1344-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-013-1344-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-013-1344-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T14:59:36Z","timestamp":1559055576000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-013-1344-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,7,31]]},"references-count":9,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2014,9]]}},"alternative-id":["1344"],"URL":"https:\/\/doi.org\/10.1007\/s00373-013-1344-6","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,7,31]]}}}