{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,9]],"date-time":"2026-01-09T21:52:38Z","timestamp":1767995558017,"version":"3.49.0"},"reference-count":19,"publisher":"Elsevier BV","issue":"11","license":[{"start":{"date-parts":[[2019,11,1]],"date-time":"2019-11-01T00:00:00Z","timestamp":1572566400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2019,11,1]],"date-time":"2019-11-01T00:00:00Z","timestamp":1572566400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2023,11,1]],"date-time":"2023-11-01T00:00:00Z","timestamp":1698796800000},"content-version":"vor","delay-in-days":1461,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"},{"start":{"date-parts":[[2019,11,1]],"date-time":"2019-11-01T00:00:00Z","timestamp":1572566400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2019,11,1]],"date-time":"2019-11-01T00:00:00Z","timestamp":1572566400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2019,11,1]],"date-time":"2019-11-01T00:00:00Z","timestamp":1572566400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2019,11,1]],"date-time":"2019-11-01T00:00:00Z","timestamp":1572566400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,11,1]],"date-time":"2019-11-01T00:00:00Z","timestamp":1572566400000},"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","id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[2019,11]]},"DOI":"10.1016\/j.disc.2019.06.006","type":"journal-article","created":{"date-parts":[[2019,6,28]],"date-time":"2019-06-28T11:02:41Z","timestamp":1561719761000},"page":"3006-3016","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":4,"title":["On <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" display=\"inline\" id=\"d1e104\" altimg=\"si28.svg\"><mml:mi>s<\/mml:mi><\/mml:math>-hamiltonian line graphs of claw-free graphs"],"prefix":"10.1016","volume":"342","author":[{"given":"Hong-Jian","family":"Lai","sequence":"first","affiliation":[]},{"given":"Mingquan","family":"Zhan","sequence":"additional","affiliation":[]},{"given":"Taoye","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Ju","family":"Zhou","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.disc.2019.06.006_b1","series-title":"Graph Theory with Applications","author":"Bondy","year":"1976"},{"key":"10.1016\/j.disc.2019.06.006_b2","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1002\/jgt.3190110314","article-title":"3-connected line graphs of triangular graphs are pan-connected and 1-hamiltonian","volume":"11","author":"Broersma","year":"1987","journal-title":"J. Graph Theory"},{"key":"10.1016\/j.disc.2019.06.006_b3","first-page":"223","article-title":"Supereulerian graph, collapsible graphs and 4-cycles","volume":"56","author":"Catlin","year":"1987","journal-title":"Congr. Numer."},{"key":"10.1016\/j.disc.2019.06.006_b4","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1002\/jgt.3190120105","article-title":"A reduction method to find spanning eulerian subgraphs","volume":"12","author":"Catlin","year":"1988","journal-title":"J. Graph Theory"},{"key":"10.1016\/j.disc.2019.06.006_b5","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1016\/S0012-365X(95)00149-Q","article-title":"Graphs without spanning eulerian subgraphs","volume":"160","author":"Catlin","year":"1996","journal-title":"Discrete Math."},{"key":"10.1016\/j.disc.2019.06.006_b6","doi-asserted-by":"crossref","first-page":"1033","DOI":"10.1016\/j.disc.2007.11.056","article-title":"Edge-connectivity and edge-disjoint spanning trees","volume":"309","author":"Catlin","year":"2009","journal-title":"Discrete Math."},{"key":"10.1016\/j.disc.2019.06.006_b7","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1007\/s00373-007-0727-y","article-title":"An s-Hamiltonian line graph problem","volume":"23","author":"Chen","year":"2007","journal-title":"Graphs Comb."},{"key":"10.1016\/j.disc.2019.06.006_b8","doi-asserted-by":"crossref","first-page":"701","DOI":"10.4153\/CMB-1965-051-3","article-title":"On eulerian and hamiltonian graphs and line graphs","volume":"8","author":"Harary","year":"1965","journal-title":"Canad. Math. Bull."},{"key":"10.1016\/j.disc.2019.06.006_b9","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1002\/jgt.3190030110","article-title":"A note on subeulerian graphs","volume":"3","author":"Jaeger","year":"1979","journal-title":"J. Graph Theory"},{"key":"10.1016\/j.disc.2019.06.006_b10","doi-asserted-by":"crossref","first-page":"306","DOI":"10.1006\/jctb.2001.2040","article-title":"Every 4-connected line graph of claw free graphs are hamiltonian-connected","volume":"82","author":"Kriesell","year":"2001","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/j.disc.2019.06.006_b11","series-title":"R. Ku\u010dzel: Hamiltonian Properties of Graphs","article-title":"Every 4-connected line graph is hamiltonian if and only if it is hamiltonian connected","author":"Ku\u010dzel","year":"2004"},{"key":"10.1016\/j.disc.2019.06.006_b12","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1007\/s00373-004-0579-7","article-title":"Spanning trails connecting given edges","volume":"21","author":"Lai","year":"2005","journal-title":"Graphs Combin."},{"key":"10.1016\/j.disc.2019.06.006_b13","doi-asserted-by":"crossref","first-page":"344","DOI":"10.1002\/jgt.21713","article-title":"On s-hamiltonian line graphs","volume":"74","author":"Lai","year":"2013","journal-title":"J. Graph Theory"},{"key":"10.1016\/j.disc.2019.06.006_b14","doi-asserted-by":"crossref","first-page":"982","DOI":"10.1016\/j.dam.2008.02.005","article-title":"Hamiltonian connectedness in 3-connected line graphs","volume":"157","author":"Lai","year":"2009","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.disc.2019.06.006_b15","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1002\/jgt.3190080116","article-title":"Hamiltonian results in K1,3-free graphs","volume":"8","author":"Matthews","year":"1984","journal-title":"J. Graph Theory"},{"key":"10.1016\/j.disc.2019.06.006_b16","doi-asserted-by":"crossref","first-page":"152","DOI":"10.1002\/jgt.20498","article-title":"Line graphs of multigraphs and hamilton-connectedness of claw-free graphs","volume":"66","author":"Ryj\u00e1\u010dek","year":"2011","journal-title":"J. Graph Theory"},{"key":"10.1016\/j.disc.2019.06.006_b17","series-title":"Claw-free graphs and line graphs","author":"Shao","year":"2005"},{"key":"10.1016\/j.disc.2019.06.006_b18","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1002\/jgt.3190100308","article-title":"Reflections on graph theory","volume":"10","author":"Thomassen","year":"1986","journal-title":"J. Graph Theory"},{"key":"10.1016\/j.disc.2019.06.006_b19","first-page":"89","article-title":"Hamiltonian connectedness of line graphs","volume":"22","author":"Zhan","year":"1986","journal-title":"Ars Combin."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X1930202X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X1930202X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,15]],"date-time":"2025-09-15T06:08:26Z","timestamp":1757916506000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X1930202X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,11]]},"references-count":19,"journal-issue":{"issue":"11","published-print":{"date-parts":[[2019,11]]}},"alternative-id":["S0012365X1930202X"],"URL":"https:\/\/doi.org\/10.1016\/j.disc.2019.06.006","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[2019,11]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"On -hamiltonian line graphs of claw-free graphs","name":"articletitle","label":"Article Title"},{"value":"Discrete Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.disc.2019.06.006","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2019 Elsevier B.V.","name":"copyright","label":"Copyright"}]}}