{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,12]],"date-time":"2026-01-12T23:09:00Z","timestamp":1768259340405,"version":"3.49.0"},"reference-count":16,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1988,12,1]],"date-time":"1988-12-01T00:00:00Z","timestamp":596937600000},"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":8994,"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":[[1988,12]]},"DOI":"10.1016\/0095-8956(88)90075-5","type":"journal-article","created":{"date-parts":[[2005,2,9]],"date-time":"2005-02-09T09:37:08Z","timestamp":1107941828000},"page":"305-319","source":"Crossref","is-referenced-by-count":36,"title":["The smallest non-hamiltonian 3-connected cubic planar graphs have 38 vertices"],"prefix":"10.1016","volume":"45","author":[{"given":"D.A","family":"Holton","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"B.D","family":"McKay","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0095-8956(88)90075-5_BIB1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0012-365X(86)90036-1","article-title":"Every simple 3-polytope with 34 vertices in hamiltonian","volume":"162","author":"Barnette","year":"1986","journal-title":"Discrete Math."},{"key":"10.1016\/0095-8956(88)90075-5_BIB2","doi-asserted-by":"crossref","first-page":"212","DOI":"10.1007\/BF02757714","article-title":"Hamiltonian circuits in simple 3-polytopes with up to 26 vertices","volume":"19","author":"Barnette","year":"1974","journal-title":"Israel J. Math."},{"key":"10.1016\/0095-8956(88)90075-5_BIB3","series-title":"Proc. International Seminar on Graph Theory and Applications","first-page":"33","article-title":"Hamiltonian lines in cubic graphs","author":"Bos\u00e1k","year":"1966"},{"key":"10.1016\/0095-8956(88)90075-5_BIB4","unstructured":"J. Bos\u00e1k, private communication to B. Gr\u00fcnbaum (1971)."},{"key":"10.1016\/0095-8956(88)90075-5_BIB5","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/0095-8956(73)90032-4","article-title":"Hamiltonian circuits on simple 3-polytopes","volume":"15","author":"Butler","year":"1973","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/0095-8956(88)90075-5_BIB6","series-title":"Recent Advances in Graph Theory","first-page":"135","article-title":"Non-hamiltonian simple 3-polytopes","author":"Butler","year":"1975"},{"key":"10.1016\/0095-8956(88)90075-5_BIB7","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/S0012-365X(74)80019-1","article-title":"Non-hamiltonian cubic planar maps","volume":"7","author":"Faulkner","year":"1974","journal-title":"Discrete Math."},{"key":"10.1016\/0095-8956(88)90075-5_BIB8","doi-asserted-by":"crossref","first-page":"504","DOI":"10.1112\/jlms\/s2-5.3.504","article-title":"Hamiltonian circuits on simple 3-polytopes","volume":"5","author":"Goodey","year":"1972","journal-title":"J. London Math. Soc. (2)"},{"key":"10.1016\/0095-8956(88)90075-5_BIB9","author":"Gr\u00fcnbaum","year":"1967"},{"key":"10.1016\/0095-8956(88)90075-5_BIB10","doi-asserted-by":"crossref","first-page":"1131","DOI":"10.1090\/S0002-9904-1970-12601-5","article-title":"Polytopes, graphs and complexes","volume":"76","author":"Gr\u00fcnbaum","year":"1970","journal-title":"Bull. Amer. Math. Soc."},{"key":"10.1016\/0095-8956(88)90075-5_BIB11","author":"Holton","year":"1986"},{"key":"10.1016\/0095-8956(88)90075-5_BIB12","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(88)90075-5_BIB13","author":"McKay","year":"1984"},{"key":"10.1016\/0095-8956(88)90075-5_BIB14","series-title":"Proc. Fourth Yugoslav Seminar on Graph Theory","first-page":"191","article-title":"Search for minimal non-hamiltonian simple 3-polytopes","author":"Mohar","year":"1983"},{"key":"10.1016\/0095-8956(88)90075-5_BIB15","doi-asserted-by":"crossref","first-page":"365","DOI":"10.2969\/jmsj\/03420365","article-title":"Hamiltonian circuits on simple 3-polytopes with up to 30 vertices","volume":"34","author":"Okamura","year":"1982","journal-title":"J. Math. Soc. Japan"},{"key":"10.1016\/0095-8956(88)90075-5_BIB16","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1002\/jgt.3190060213","article-title":"Every simple 3-polytope of order 32 or less is hamiltonian","volume":"6","author":"Okamura","year":"1982","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:0095895688900755?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0095895688900755?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,29]],"date-time":"2019-01-29T10:53:47Z","timestamp":1548759227000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0095895688900755"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988,12]]},"references-count":16,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1988,12]]}},"alternative-id":["0095895688900755"],"URL":"https:\/\/doi.org\/10.1016\/0095-8956(88)90075-5","relation":{},"ISSN":["0095-8956"],"issn-type":[{"value":"0095-8956","type":"print"}],"subject":[],"published":{"date-parts":[[1988,12]]}}}