{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:36:46Z","timestamp":1759639006384},"reference-count":6,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2001,5,1]],"date-time":"2001-05-01T00:00:00Z","timestamp":988675200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[2001,5]]},"DOI":"10.1016\/s0020-0190(00)00164-2","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T21:59:10Z","timestamp":1027634350000},"page":"17-24","source":"Crossref","is-referenced-by-count":11,"title":["A linear algorithm for the Hamiltonian completion number of the line graph of a tree"],"prefix":"10.1016","volume":"79","author":[{"given":"A.","family":"Agnetis","sequence":"first","affiliation":[]},{"given":"P.","family":"Detti","sequence":"additional","affiliation":[]},{"given":"C.","family":"Meloni","sequence":"additional","affiliation":[]},{"given":"D.","family":"Pacciarelli","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0020-0190(00)00164-2_BIB001","series-title":"Set-up coordination between two stages of a supply chain, Tech. Rept. No. 32-99","author":"Agnetis","year":"1999"},{"key":"10.1016\/S0020-0190(00)00164-2_BIB002","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1016\/0020-0190(81)90048-X","article-title":"The edge Hamiltonian problem is NP-hard","volume":"13","author":"Bertossi","year":"1981","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0020-0190(00)00164-2_BIB003","series-title":"Graphs and Combinatorics","first-page":"262","article-title":"On the Hamiltonian completion problems","volume":"406","author":"Goodman","year":"1974"},{"key":"10.1016\/S0020-0190(00)00164-2_BIB004","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1016\/0020-0190(76)90080-6","article-title":"A linear algorithm for the Hamiltonian completion number of a tree","volume":"5","author":"Kundu","year":"1976","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0020-0190(00)00164-2_BIB005","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1016\/0020-0190(95)00163-8","article-title":"The total interval number of a tree and the Hamiltonian completion number of its line graph","volume":"56","author":"Raychaudhuri","year":"1995","journal-title":"Inform. Process. Lett."},{"issue":"3","key":"10.1016\/S0020-0190(00)00164-2_BIB006","doi-asserted-by":"crossref","first-page":"413","DOI":"10.1002\/jgt.3190120312","article-title":"A result on Hamiltonian line graphs involving restrictions on induced subgraphs","volume":"12","author":"Veldman","year":"1988","journal-title":"J. Graph Theory"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019000001642?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019000001642?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,19]],"date-time":"2019-04-19T18:22:59Z","timestamp":1555698179000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019000001642"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,5]]},"references-count":6,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2001,5]]}},"alternative-id":["S0020019000001642"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(00)00164-2","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[2001,5]]}}}