{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,11,12]],"date-time":"2023-11-12T09:51:04Z","timestamp":1699782664815},"reference-count":7,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1977,6,1]],"date-time":"1977-06-01T00:00:00Z","timestamp":233971200000},"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":13195,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Combinatorial Theory, Series B"],"published-print":{"date-parts":[[1977,6]]},"DOI":"10.1016\/0095-8956(77)90071-5","type":"journal-article","created":{"date-parts":[[2004,12,21]],"date-time":"2004-12-21T20:34:55Z","timestamp":1103661295000},"page":"263-273","source":"Crossref","is-referenced-by-count":6,"title":["On n-Hamiltonian line graphs"],"prefix":"10.1016","volume":"22","author":[{"given":"Linda","family":"Lesniak-Foster","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0095-8956(77)90071-5_BIB1","author":"Behzad","year":"1971"},{"key":"10.1016\/0095-8956(77)90071-5_BIB2","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\/0095-8956(77)90071-5_BIB3","first-page":"43","article-title":"On the Hamiltonian index of a graph","volume":"8","author":"Chartrand","year":"1973","journal-title":"Studia Sci. Math. Hungar."},{"key":"10.1016\/0095-8956(77)90071-5_BIB4","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\/0095-8956(77)90071-5_BIB5","unstructured":"L. Lesniak and J. E. Williamson, On spanning and dominating circuits in graphs, Canad. Math. Bull., to appear."},{"key":"10.1016\/0095-8956(77)90071-5_BIB6","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1007\/BF02412090","article-title":"Arc covertings of graphs","volume":"55","author":"Ore","year":"1961","journal-title":"Ann. Math. Pura \u00c1ppl."},{"key":"10.1016\/0095-8956(77)90071-5_BIB7","article-title":"On Hamiltonian-Connected Graphs","author":"Williamson","year":"1973"}],"container-title":["Journal of Combinatorial Theory, Series B"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0095895677900715?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0095895677900715?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,30]],"date-time":"2019-01-30T14:50:04Z","timestamp":1548859804000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0095895677900715"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1977,6]]},"references-count":7,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1977,6]]}},"alternative-id":["0095895677900715"],"URL":"https:\/\/doi.org\/10.1016\/0095-8956(77)90071-5","relation":{},"ISSN":["0095-8956"],"issn-type":[{"value":"0095-8956","type":"print"}],"subject":[],"published":{"date-parts":[[1977,6]]}}}