{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T03:35:31Z","timestamp":1777520131094,"version":"3.51.4"},"reference-count":17,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1992,3,1]],"date-time":"1992-03-01T00:00:00Z","timestamp":699408000000},"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":7808,"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":[[1992,3]]},"DOI":"10.1016\/0095-8956(92)90058-6","type":"journal-article","created":{"date-parts":[[2005,2,9]],"date-time":"2005-02-09T14:00:02Z","timestamp":1107957602000},"page":"291-321","source":"Crossref","is-referenced-by-count":15,"title":["Longest cycles in 3-connected planar graphs"],"prefix":"10.1016","volume":"54","author":[{"given":"Bill","family":"Jackson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nicholas C","family":"Wormald","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0095-8956(92)90058-6_BIB1","doi-asserted-by":"crossref","first-page":"731","DOI":"10.4153\/CJM-1966-073-4","article-title":"Trees in polyhedral graphs","volume":"18","author":"Barnette","year":"1966","journal-title":"Canad. J. Math."},{"key":"10.1016\/0095-8956(92)90058-6_BIB2","first-page":"199","article-title":"Longest cycles in 3-connected planar graphs","volume":"47","author":"Clark","year":"1985"},{"key":"10.1016\/0095-8956(92)90058-6_BIB3","author":"Bondy","year":"1976"},{"key":"10.1016\/0095-8956(92)90058-6_BIB4","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1007\/BF01836218","article-title":"Pairs of edge-disjoint Hamilton circuits","volume":"14","author":"Gr\u00fcnbaum","year":"1976","journal-title":"Aequationes Math."},{"key":"10.1016\/0095-8956(92)90058-6_BIB5","doi-asserted-by":"crossref","first-page":"364","DOI":"10.1016\/0097-3165(73)90012-5","article-title":"Shortness exponents of families of graphs","volume":"14","author":"Gr\u00fcnbaum","year":"1973","journal-title":"J. Combin. Theory Ser. A"},{"key":"10.1016\/0095-8956(92)90058-6_BIB6","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1016\/0095-8956(86)90024-9","article-title":"Longest cycles in 3-connected cubic graphs","volume":"41","author":"Jackson","year":"1986","journal-title":"J. Combin. Theory Ser B"},{"key":"10.1016\/0095-8956(92)90058-6_BIB7","doi-asserted-by":"crossref","first-page":"522","DOI":"10.2307\/2314879","article-title":"Hamiltonian circuits on convex trivalent polyhedra (up to 18 vertices)","volume":"74","author":"Lederberg","year":"1967","journal-title":"Amer. Math. Monthly"},{"key":"10.1016\/0095-8956(92)90058-6_BIB8","doi-asserted-by":"crossref","first-page":"629","DOI":"10.2140\/pjm.1963.13.629","article-title":"Simple paths on polyhedra","volume":"13","author":"Moon","year":"1963","journal-title":"Pacific J. Math."},{"key":"10.1016\/0095-8956(92)90058-6_BIB9","author":"Ore","year":"1967"},{"key":"10.1016\/0095-8956(92)90058-6_BIB10","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1016\/0022-247X(68)90163-7","article-title":"Applications of Menger's graph theorems","volume":"22","author":"Perfect","year":"1968","journal-title":"J. Math. Anal. Appl."},{"key":"10.1016\/0095-8956(92)90058-6_BIB11","doi-asserted-by":"crossref","first-page":"283","DOI":"10.4153\/CMB-1973-047-4","article-title":"On cycles and connectivity in planar graphs","volume":"16","author":"Plummer","year":"1973","journal-title":"Canad. Math. Bull."},{"key":"10.1016\/0095-8956(92)90058-6_BIB12","author":"Rockafeller","year":"1970"},{"key":"10.1016\/0095-8956(92)90058-6_BIB13","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1002\/jgt.3190070205","article-title":"A theorem on paths in planar graphs","volume":"7","author":"Thomassen","year":"1983","journal-title":"J. Graph. Theory"},{"key":"10.1016\/0095-8956(92)90058-6_BIB14","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1090\/S0002-9947-1956-0081471-8","article-title":"A theorem on planar graphs","volume":"82","author":"Tutte","year":"1956","journal-title":"Trans. Amer. Math. Soc."},{"key":"10.1016\/0095-8956(92)90058-6_BIB15","author":"Tutte","year":"1966"},{"key":"10.1016\/0095-8956(92)90058-6_BIB16","author":"Wilson","year":"1985"},{"key":"10.1016\/0095-8956(92)90058-6_BIB17","doi-asserted-by":"crossref","first-page":"521","DOI":"10.1002\/jgt.3190110409","article-title":"Longest cycles and their chords","volume":"11","author":"Zhang","year":"1987","journal-title":"J. Graph Theory"}],"container-title":["Journal of Combinatorial Theory, Series B"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0095895692900586?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0095895692900586?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,29]],"date-time":"2019-01-29T18:28:47Z","timestamp":1548786527000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0095895692900586"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,3]]},"references-count":17,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1992,3]]}},"alternative-id":["0095895692900586"],"URL":"https:\/\/doi.org\/10.1016\/0095-8956(92)90058-6","relation":{},"ISSN":["0095-8956"],"issn-type":[{"value":"0095-8956","type":"print"}],"subject":[],"published":{"date-parts":[[1992,3]]}}}