{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:05:35Z","timestamp":1740107135191,"version":"3.37.3"},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2015,6,26]],"date-time":"2015-06-26T00:00:00Z","timestamp":1435276800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"NSFC","doi-asserted-by":"crossref","award":["11371062"],"award-info":[{"award-number":["11371062"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"NSFC","doi-asserted-by":"crossref","award":["11271149"],"award-info":[{"award-number":["11271149"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2016,3]]},"DOI":"10.1007\/s00373-015-1598-2","type":"journal-article","created":{"date-parts":[[2015,6,25]],"date-time":"2015-06-25T03:53:52Z","timestamp":1435204432000},"page":"685-705","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Every 3-connected $$\\{K_{1,3},N_{1,2,3}\\}$$ { K 1 , 3 , N 1 , 2 , 3 } -free graph is Hamilton-connected"],"prefix":"10.1007","volume":"32","author":[{"given":"Zhiquan","family":"Hu","sequence":"first","affiliation":[]},{"given":"Shunzhe","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,6,26]]},"reference":[{"key":"1598_CR1","unstructured":"Bedrossian, P.: Forbidden subgraph and minimum degree conditions for hamiltonicity. Ph.D. Thesis, Memphis State University (1991)"},{"key":"1598_CR2","unstructured":"Beineke, L.W.: Derived graphs and digraphs. In: Beitrage zur Graphentheorie, Teubner, Leipzig, pp. 17\u201333 (1968)"},{"key":"1598_CR3","first-page":"299","volume":"52","author":"JC Bermond","year":"1973","unstructured":"Bermond, J.C., Meyer, J.C.: Graphe representatif des arretes d\u2019un multigraphe. J Math Pures Appl. 52, 299\u2013308 (1973)","journal-title":"J Math Pures Appl."},{"key":"1598_CR4","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/S0012-365X(98)00165-4","volume":"195","author":"B Bollob\u00e1s","year":"1999","unstructured":"Bollob\u00e1s, B., Riordan, O., Ryj\u00e1\u010dek, Z., Saito, A., Schelp, R.H.: Closure and hamiltonian-connectivity of claw-free graphs. Discrete Math. 195, 67\u201380 (1999)","journal-title":"Discrete Math."},{"key":"1598_CR5","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-84628-970-5","volume-title":"Graph theory","author":"JA Bondy","year":"2008","unstructured":"Bondy, J.A., Murty, U.S.A.: Graph theory, 2nd edn. Springer, New York (2008)","edition":"2"},{"issue":"2","key":"1598_CR6","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(2), 104\u2013119 (2002)","journal-title":"J. Graph Theory."},{"key":"1598_CR7","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/S0012-365X(98)00334-3","volume":"196","author":"J Brousek","year":"1999","unstructured":"Brousek, J., Favaron, O., Ryj\u00e1\u010dek, Z.: Forbidden subgraphs, hamiltonicity and closure in claw-free graphs. Discrete Math. 196, 29\u201350 (1999)","journal-title":"Discrete Math."},{"key":"1598_CR8","first-page":"25","volume":"29","author":"G Chen","year":"2000","unstructured":"Chen, G., Gould, R.J.: Hamiltonian connected graphs involving forbidden subgraphs. Bull Inst Combin Appl. 29, 25\u201332 (2000)","journal-title":"Bull Inst Combin Appl."},{"key":"1598_CR9","first-page":"247","volume":"72","author":"JR Faudree","year":"2012","unstructured":"Faudree, J.R., Faudree, R.J., Ryj\u00e1\u010dek, Z., Vr\u00e1na, P.: On forbidden pairs implying Hamiltion-connectedness. J. Graph Theory. 72, 247\u2013365 (2012)","journal-title":"J. Graph Theory."},{"key":"1598_CR10","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/S0012-365X(96)00147-1","volume":"173","author":"RJ Faudree","year":"1997","unstructured":"Faudree, R.J., Gould, R.J.: Characterizing forbidden pairs for hamiltonian properties. Discrete Math. 173, 45\u201360 (1997)","journal-title":"Discrete Math."},{"key":"1598_CR11","doi-asserted-by":"crossref","first-page":"701","DOI":"10.4153\/CMB-1965-051-3","volume":"8","author":"F Harary","year":"1965","unstructured":"Harary, F., St JA Nash-Williams, C.: On eulerian and hamiltonian graphs and line graphs. Canad Math Bull. 8, 701\u2013710 (1965)","journal-title":"Canad Math Bull."},{"key":"1598_CR12","doi-asserted-by":"crossref","first-page":"422","DOI":"10.1016\/j.dam.2004.04.005","volume":"145","author":"D Li","year":"2005","unstructured":"Li, D., Lai, H.-J., Zhan, M.: Eulerian subgraphs and hamilton-connected line graphs. Discrete Appl Math. 145, 422\u2013428 (2005)","journal-title":"Discrete Appl Math."},{"key":"1598_CR13","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1002\/jgt.20497","volume":"66","author":"Z Ryj\u00e1\u010dek","year":"2011","unstructured":"Ryj\u00e1\u010dek, Z., Vr\u00e1na, P.: On stability of hamilton-connectedness under the 2-closure in claw-free graphs. J. Graph Theory. 66, 137\u2013151 (2011)","journal-title":"J. Graph Theory."},{"key":"1598_CR14","doi-asserted-by":"crossref","first-page":"152","DOI":"10.1002\/jgt.20498","volume":"66","author":"Z Ryj\u00e1\u010dek","year":"2011","unstructured":"Ryj\u00e1\u010dek, Z., Vr\u00e1na, P.: Line graphs of multigraphs and hamilton-connectedness of claw-free graphs. J. Graph Theory. 66, 152\u2013173 (2011)","journal-title":"J. Graph Theory."},{"key":"1598_CR15","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/0095-8956(91)90074-T","volume":"53","author":"FB Shepherd","year":"1991","unstructured":"Shepherd, F.B.: Hamiltonicity in claw-free graphs. J. Combin Theory B 53, 173\u2013194 (1991)","journal-title":"J. Combin Theory B"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-015-1598-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-015-1598-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-015-1598-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T10:59:41Z","timestamp":1559041181000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-015-1598-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,6,26]]},"references-count":15,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2016,3]]}},"alternative-id":["1598"],"URL":"https:\/\/doi.org\/10.1007\/s00373-015-1598-2","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"type":"print","value":"0911-0119"},{"type":"electronic","value":"1435-5914"}],"subject":[],"published":{"date-parts":[[2015,6,26]]}}}