{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,18]],"date-time":"2023-10-18T10:34:14Z","timestamp":1697625254129},"reference-count":5,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1997,6,1]],"date-time":"1997-06-01T00:00:00Z","timestamp":865123200000},"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":5890,"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":[[1997,6]]},"DOI":"10.1016\/s0012-365x(96)00008-8","type":"journal-article","created":{"date-parts":[[2003,4,30]],"date-time":"2003-04-30T22:23:46Z","timestamp":1051741426000},"page":"195-201","source":"Crossref","is-referenced-by-count":6,"title":["Longest cycles in 3-connected graphs"],"prefix":"10.1016","volume":"170","author":[{"given":"B.","family":"Wei","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0012-365X(96)00008-8_BIB1","doi-asserted-by":"crossref","first-page":"529","DOI":"10.1002\/jgt.3190160602","article-title":"An improvement of Fraisse's sufficient condition for Hamiltonian graphs","volume":"16","author":"Ainouche","year":"1992","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0012-365X(96)00008-8_BIB2","doi-asserted-by":"crossref","first-page":"555","DOI":"10.1002\/jgt.3190110413","article-title":"Extremal problems involving neighborhood unions","volume":"11","author":"Fandree","year":"1987","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0012-365X(96)00008-8_BIB3","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/0012-365X(91)90094-I","article-title":"Hamiltonism, Degree sum and neighborhood intersections","volume":"90","author":"Flandrin","year":"1991","journal-title":"Discrete Math."},{"key":"10.1016\/S0012-365X(96)00008-8_BIB4","series-title":"Recent Studies in Graph Theory","first-page":"114","article-title":"Longest cycles and independent sets in k-connected graphs","author":"Fraisse","year":"1989"},{"key":"10.1016\/S0012-365X(96)00008-8_BIB5","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/0012-365X(93)90555-8","article-title":"Hamiltonian paths and hamiltonian connectivity in graphs","volume":"121","author":"Wei","year":"1993","journal-title":"Discrete Math."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X96000088?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X96000088?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,21]],"date-time":"2019-03-21T19:26:59Z","timestamp":1553196419000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X96000088"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,6]]},"references-count":5,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1997,6]]}},"alternative-id":["S0012365X96000088"],"URL":"https:\/\/doi.org\/10.1016\/s0012-365x(96)00008-8","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1997,6]]}}}