{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T14:06:57Z","timestamp":1775052417944,"version":"3.50.1"},"reference-count":7,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1988,3,1]],"date-time":"1988-03-01T00:00:00Z","timestamp":573177600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":9269,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[1988,3]]},"DOI":"10.1016\/0012-365x(88)90176-8","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:43:43Z","timestamp":1027640623000},"page":"43-53","source":"Crossref","is-referenced-by-count":23,"title":["On the Hamiltonian index"],"prefix":"10.1016","volume":"69","author":[{"given":"Hong-Jian","family":"Lai","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(88)90176-8_BIB1","series-title":"Graph Theory with Applications","author":"Bondy","year":"1976"},{"key":"10.1016\/0012-365X(88)90176-8_BIB2","unstructured":"P.A. Catlin, Removing forests to find spanning Eulerian subgraphs, preprint."},{"issue":"3","key":"10.1016\/0012-365X(88)90176-8_BIB3","doi-asserted-by":"crossref","first-page":"559","DOI":"10.1090\/S0002-9947-1968-0231740-1","article-title":"On Hamiltonian line graphs","volume":"134","author":"Chartrand","year":"1968","journal-title":"Trans. Amer. Math. Soc."},{"key":"10.1016\/0012-365X(88)90176-8_BIB4","first-page":"43","article-title":"On the Hamiltonian index of a graph","volume":"8","author":"Chartrand","year":"1973","journal-title":"Studia. Sci. Math. Hung."},{"key":"10.1016\/0012-365X(88)90176-8_BIB5","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1016\/0012-365X(81)90058-3","article-title":"On line graphs and the Hamiltonian index","volume":"34","author":"Gould","year":"1981","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(88)90176-8_BIB6","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":"9","author":"Harary","year":"1965","journal-title":"Canad. Math. Bull."},{"key":"10.1016\/0012-365X(88)90176-8_BIB7","doi-asserted-by":"crossref","first-page":"215","DOI":"10.4153\/CMB-1977-034-8","article-title":"On spanning and dominating circuits in graphs","volume":"20","author":"Lesniak-Foster","year":"1977","journal-title":"Canad. Math. Bull."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X88901768?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X88901768?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T01:26:40Z","timestamp":1555118800000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X88901768"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988,3]]},"references-count":7,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1988,3]]}},"alternative-id":["0012365X88901768"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(88)90176-8","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1988,3]]}}}