{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,6,26]],"date-time":"2022-06-26T06:07:54Z","timestamp":1656223674876},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2013,1,23]],"date-time":"2013-01-23T00:00:00Z","timestamp":1358899200000},"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,3]]},"DOI":"10.1007\/s00373-012-1280-x","type":"journal-article","created":{"date-parts":[[2013,1,22]],"date-time":"2013-01-22T14:45:45Z","timestamp":1358865945000},"page":"501-510","source":"Crossref","is-referenced-by-count":2,"title":["Collapsible Graphs and Hamiltonicity of Line Graphs"],"prefix":"10.1007","volume":"30","author":[{"given":"Weihua","family":"Yang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hong-Jian","family":"Lai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hao","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaofeng","family":"Guo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,1,23]]},"reference":[{"key":"1280_CR1","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-349-03521-2","volume-title":"Graph theory with application","author":"J.A. Bondy","year":"1976","unstructured":"Bondy J.A., Bondy J.A.: Graph theory with application. Macmillan, London (1976)"},{"key":"1280_CR2","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1002\/jgt.3190120105","volume":"12","author":"P.A. Catlin","year":"1988","unstructured":"Catlin P.A.: A reduction method to find spanning Eulerian subgraphs, J. Graph Theory 12, 29\u201345 (1988)","journal-title":"Graph Theory"},{"key":"1280_CR3","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1016\/S0012-365X(95)00149-Q","volume":"160","author":"P.A. Catlin","year":"1996","unstructured":"Catlin P.A., Han Z., Lai H.-J.: Graphs without spanning eulerian subgraphs. Discrete Math. 160, 81\u201391 (1996)","journal-title":"Discrete Math."},{"key":"1280_CR4","unstructured":"Chen, Z.-H., Lai, H.-J.: Reduction techniques for supereulerian graphs and related topics: an update. In: Tung-Hsin, K. (ed.) Combinatorics and Graph Theory, vol. 95, pp. 53\u201369. World Scientific, Singapore (1995)"},{"key":"1280_CR5","unstructured":"Chen, Z.-H., Lai, H.-Y., Lai, H.-J., Weng, G.Q.: Jacson\u2019s conjecture on wularian subgraphs. In: Alavi, Y., Lick, D.R., Liu, J. (eds.) Combinatorics, Graph Theory, Algorithms and Applications, pp. 53\u201358. The Proceeding of the Third China-USA Conference, Beijing, P.R. China (1993)"},{"key":"1280_CR6","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1016\/0020-0190(88)90025-7","volume":"27","author":"A.H. Esfahanian","year":"1988","unstructured":"Esfahanian A.H., Hakimi S.L.: On computing a conditional edge-connectivity of a graph. Inf. Process. Lett. 27, 195\u2013199 (1988)","journal-title":"Inf. Process. Lett."},{"key":"1280_CR7","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1002\/jgt.20099","volume":"50","author":"Z. Hu","year":"2005","unstructured":"Hu Z., Tian F., Wei B.: Hamilton connectivity of line graphs and claw-free graphs. J. Graph Theory 50, 130\u2013141 (2005)","journal-title":"J. Graph Theory"},{"key":"1280_CR8","unstructured":"Hu, Z., Tian, F., Wei, B.: Some results on paths and cycles in claw-free graphs. Preprint"},{"key":"1280_CR9","unstructured":"Kaiser, T., Vr\u00e1na, P.: Hamilton cycles in 5-connected line graphs. Submitted on 20 Sep 2010. arXiv:1009.3754v1"},{"key":"1280_CR10","unstructured":"Lai, H.-J., Shao, Y., Wu, H., Zhou J.: Every 3-connected, essentially 11-connected line graph is Hamiltonian. J. Combin. Theory Ser. B 96, 571\u2013576 (2006)"},{"issue":"5","key":"1280_CR11","doi-asserted-by":"crossref","first-page":"982","DOI":"10.1016\/j.dam.2008.02.005","volume":"157","author":"H.-J. Lai","year":"2009","unstructured":"Lai H.-J., Shao Y., Yu G., Zhan M.: Hamiltonian connectedness in 3-connected line graphs. Discrete Appl. Math. 157(5), 982\u2013990 (2009)","journal-title":"Discrete Appl. Math."},{"key":"1280_CR12","unstructured":"Li, H.: A note on Hamiltonian claw-free graphs. Rapport de recherche no. 1022, LRI, UMR 8623 CNRS-UPS, Bat. 490, Universit\u00e9 de Paris sud, 91405 Orsay, France (1996)"},{"key":"1280_CR13","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1002\/jgt.3190080116","volume":"8","author":"M.M. Matthews","year":"1984","unstructured":"Matthews M.M., Sumner D.P.: Hamiltonian results in K 1, 3-free graphs. J. Graph Theory 8, 139\u2013146 (1984)","journal-title":"J. Graph Theory"},{"key":"1280_CR14","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1006\/jctb.1996.1732","volume":"70","author":"Z. Ryj\u00e1\u010dek","year":"1997","unstructured":"Ryj\u00e1\u010dek Z.: On a closure concept in claw-free graphs. J. Combin. Theory Ser. B 70, 217\u2013224 (1997)","journal-title":"J. Combin. Theory Ser. B"},{"key":"1280_CR15","unstructured":"Shao, Y.: Claw-free graphs and line graphs. Ph.D dissertation, West Virginia University (2005)"},{"key":"1280_CR16","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1002\/jgt.3190100308","volume":"10","author":"C. Thomassen","year":"1986","unstructured":"Thomassen C.: Reflections on graph theory. J. Graph Theory 10, 309\u2013324 (1986)","journal-title":"J. Graph Theory"},{"key":"1280_CR17","unstructured":"Yang, W., Lai, H., Li, H., Xiao, G.: Collapsible graphs and hamiltonicity of line graphs. Submitted"},{"key":"1280_CR18","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/0012-365X(91)90401-M","volume":"89","author":"S. Zhan","year":"1991","unstructured":"Zhan S.: On Hamiltonian line graphs and connectivity. Discrete Math. 89, 89\u201395 (1991)","journal-title":"Discrete Math."},{"key":"1280_CR19","doi-asserted-by":"crossref","first-page":"1971","DOI":"10.1016\/j.dam.2010.07.011","volume":"158","author":"M. Zhan","year":"2010","unstructured":"Zhan M.: Hamiltonicity of 6-connected line graphs. Discrete Appl. Math. 158, 1971\u20131975 (2010)","journal-title":"Discrete Appl. Math."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-012-1280-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-012-1280-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-012-1280-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T14:59:35Z","timestamp":1559055575000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-012-1280-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,1,23]]},"references-count":19,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2014,3]]}},"alternative-id":["1280"],"URL":"https:\/\/doi.org\/10.1007\/s00373-012-1280-x","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,1,23]]}}}