{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T01:34:59Z","timestamp":1649122499027},"reference-count":8,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2012,8,3]],"date-time":"2012-08-03T00:00:00Z","timestamp":1343952000000},"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":[[2013,9]]},"DOI":"10.1007\/s00373-012-1210-y","type":"journal-article","created":{"date-parts":[[2012,8,2]],"date-time":"2012-08-02T05:18:45Z","timestamp":1343884725000},"page":"1259-1267","source":"Crossref","is-referenced-by-count":1,"title":["Hamiltonian Connectedness in Claw-Free Graphs"],"prefix":"10.1007","volume":"29","author":[{"given":"Xiaodong","family":"Chen","sequence":"first","affiliation":[]},{"given":"Mingchu","family":"Li","sequence":"additional","affiliation":[]},{"given":"Xin","family":"Ma","sequence":"additional","affiliation":[]},{"given":"Xinxin","family":"Fan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,8,3]]},"reference":[{"key":"1210_CR1","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1002\/(SICI)1097-0118(199610)23:2<191::AID-JGT10>3.0.CO;2-K","volume":"23","author":"A.S. Asratian","year":"1996","unstructured":"Asratian A.S.: Every 3-connected locally connected claw-free graph is Hamilton-connected. J. Graph Theory 23, 191\u2013201 (1996)","journal-title":"J. Graph Theory"},{"key":"1210_CR2","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-349-03521-2","volume-title":"Graph Theory with Its Applications","author":"J.A. Bondy","year":"1976","unstructured":"Bondy J.A., Murty U.S.R.: Graph Theory with Its Applications. American Elsevier, New York (1976)"},{"key":"1210_CR3","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1002\/jgt.3190110314","volume":"11","author":"H.J. Broersma","year":"1987","unstructured":"Broersma H.J., Veldman H.J.: 3-connected line graphs of triangular graphs are panconnected and 1-hamiltonian. J. Graph Theory 11, 399\u2013407 (1987)","journal-title":"J. Graph Theory"},{"key":"1210_CR4","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1007\/BF02760528","volume":"33","author":"G. Chartrand","year":"1979","unstructured":"Chartrand G., Gould R.J., Polimeni A.D.: A note on locally connected and Hamilton-connected graphs. Israel J. Math 33, 5\u20138 (1979)","journal-title":"Israel J. Math"},{"key":"1210_CR5","first-page":"199","volume":"32","author":"L. Clark","year":"1981","unstructured":"Clark L.: Hamiltonian properties of connected, locally connected graphs. Congr. Numer. 32, 199\u2013204 (1981)","journal-title":"Congr. Numer."},{"key":"1210_CR6","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1002\/jgt.3190080302","volume":"8","author":"S.V. Kanetkar","year":"1984","unstructured":"Kanetkar S.V., Rao P.R.: Connected locally 2-connected K 1,3-free graphs are panconnected. J. Graph Theory 8, 347\u2013353 (1984)","journal-title":"J. Graph Theory"},{"key":"1210_CR7","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1016\/S0012-365X(99)00010-2","volume":"203","author":"Y. Sheng","year":"1999","unstructured":"Sheng Y., Tian F., Wei B.: Panconnectivity of locally connected claw-free graphs. Discrete. Math 203, 253\u2013260 (1999)","journal-title":"Discrete. Math"},{"key":"1210_CR8","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1016\/0012-365X(89)90186-6","volume":"78","author":"C.Q. Zhang","year":"1989","unstructured":"Zhang C.Q.: Cycles of given length in some K 1,3-free graphs. Discrete. Math 78, 307\u2013313 (1989)","journal-title":"Discrete. Math"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-012-1210-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-012-1210-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-012-1210-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T10:59:34Z","timestamp":1559041174000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-012-1210-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,8,3]]},"references-count":8,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2013,9]]}},"alternative-id":["1210"],"URL":"https:\/\/doi.org\/10.1007\/s00373-012-1210-y","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,8,3]]}}}