{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,11]],"date-time":"2026-02-11T13:40:20Z","timestamp":1770817220724,"version":"3.50.1"},"reference-count":25,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1974,7,1]],"date-time":"1974-07-01T00:00:00Z","timestamp":141868800000},"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":14261,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Combinatorial Theory, Series A"],"published-print":{"date-parts":[[1974,7]]},"DOI":"10.1016\/0097-3165(74)90025-9","type":"journal-article","created":{"date-parts":[[2004,9,8]],"date-time":"2004-09-08T14:32:55Z","timestamp":1094653975000},"page":"31-38","source":"Crossref","is-referenced-by-count":33,"title":["Vertices missed by longest paths or circuits"],"prefix":"10.1016","volume":"17","author":[{"given":"Branko","family":"Gr\u00fcnbaum","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0097-3165(74)90025-9_BIB1","first-page":"405","article-title":"Probl\u00e8mes plaisants et delectables, No. 29","volume":"7","author":"Berge","year":"1963","journal-title":"Rev. Fran\u00e7. Rech. Op\u00e9rat."},{"key":"10.1016\/0097-3165(74)90025-9_BIB2","series-title":"Graphes et Hypergraphes","author":"Berge","year":"1970"},{"key":"10.1016\/0097-3165(74)90025-9_BIB3","first-page":"78","article-title":"Proof of the indecomposability of a certain graph","volume":"4","author":"Bilinski","year":"1949","journal-title":"Hrvatsko Prirodoslovno Dru\u0161tvo. Glasnik Mat.-Fiz. Astr. Ser. II"},{"key":"10.1016\/0097-3165(74)90025-9_BIB4","doi-asserted-by":"crossref","first-page":"57","DOI":"10.4153\/CMB-1972-012-3","article-title":"Variations on the Hamiltonian theme","volume":"15","author":"Bondy","year":"1972","journal-title":"Canad. Math. Bull."},{"key":"10.1016\/0097-3165(74)90025-9_BIB5","series-title":"Finite Graphs and Networks","author":"Busacker","year":"1965"},{"key":"10.1016\/0097-3165(74)90025-9_BIB6","series-title":"Applied Graph Theory","author":"Chen","year":"1971"},{"key":"10.1016\/0097-3165(74)90025-9_BIB7","doi-asserted-by":"crossref","first-page":"33","DOI":"10.4153\/CMB-1973-008-9","article-title":"Flip-flops in hypohamiltonian graphs","volume":"16","author":"Chv\u00e1tal","year":"1973","journal-title":"Canad. Math. Bull."},{"key":"10.1016\/0097-3165(74)90025-9_BIB8","series-title":"New Directions in the Theory of Graphs","first-page":"65","article-title":"New directions in Hamiltonian graph theory","author":"Chv\u00e1tal","year":"1973"},{"key":"10.1016\/0097-3165(74)90025-9_BIB9","series-title":"Theory of Graphs","year":"1968"},{"key":"10.1016\/0097-3165(74)90025-9_BIB10","article-title":"Recursive generation of cyclically k-connected cubic planar graphs","author":"Faulkner","year":"1971"},{"key":"10.1016\/0097-3165(74)90025-9_BIB11","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\/0097-3165(74)90025-9_BIB12","first-page":"51","article-title":"Plane homogeneous graphs of degree three without Hamiltonian circuits","volume":"4","author":"Grinberg","year":"1968"},{"key":"10.1016\/0097-3165(74)90025-9_BIB13","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\/0097-3165(74)90025-9_BIB14","series-title":"Th\u00e9orie des Graphes","first-page":"153","article-title":"Recherche syst\u00e9matique des graphes hypohamiltoniens","author":"Herz","year":"1967"},{"key":"10.1016\/0097-3165(74)90025-9_BIB15","first-page":"214","article-title":"Solution du probl\u00e8me No. 29","volume":"8","author":"Herz","year":"1964","journal-title":"Rev. Fran\u00e7. Rech. Op\u00e9rat."},{"key":"10.1016\/0097-3165(74)90025-9_BIB16","unstructured":"J. D. Horton, A hypotraceable graph (to appear)."},{"key":"10.1016\/0097-3165(74)90025-9_BIB17","doi-asserted-by":"crossref","first-page":"195","DOI":"10.4153\/CMB-1968-022-8","article-title":"On detours in graphs","volume":"11","author":"Kapoor","year":"1968","journal-title":"Canad. Math. Bull."},{"key":"10.1016\/0097-3165(74)90025-9_BIB18","doi-asserted-by":"crossref","first-page":"809","DOI":"10.2307\/2317879","article-title":"Does there exist a hypotraceable graph?","volume":"76","author":"Kronk","year":"1969","journal-title":"Amer. Math. Monthly"},{"key":"10.1016\/0097-3165(74)90025-9_BIB19","doi-asserted-by":"crossref","first-page":"1087","DOI":"10.2307\/2313617","article-title":"An infinite class of hypohamiltonian graphs","volume":"74","author":"Lindgren","year":"1967","journal-title":"Amer. Math. Monthly"},{"key":"10.1016\/0097-3165(74)90025-9_BIB20","series-title":"Beitr\u00e4ge zur Graphentheorie","first-page":"127","article-title":"Ein von Kozyrev und Grinberg angegebener nicht-Hamiltonischer kubischer planarer Graph","author":"Sachs","year":"1968"},{"issue":"No. 61","key":"10.1016\/0097-3165(74)90025-9_BIB21","article-title":"Hypohamiltonian and hypotraceable graphs","author":"Thomassen","year":"1972","journal-title":"Aarhus Univ. Mat. Inst. Preprint Series"},{"key":"10.1016\/0097-3165(74)90025-9_BIB22","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\/0097-3165(74)90025-9_BIB23","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0021-9800(69)80098-0","article-title":"\u00dcber die Nichtexistenz eines Knotenpunktes, durch den alle l\u00e4ngsten Wege eines Graphes gehen","volume":"6","author":"Walther","year":"1969","journal-title":"J. Combinatorial Theory"},{"key":"10.1016\/0097-3165(74)90025-9_BIB24","doi-asserted-by":"crossref","first-page":"330","DOI":"10.1016\/S0021-9800(70)80085-0","article-title":"\u00dcber die Nichtexistenz zweier Knotenpunkte eines Graphen, die alle l\u00e4ngsten Kreise fassen","volume":"8","author":"Walther","year":"1970","journal-title":"J. Combinatorial Theory"},{"key":"10.1016\/0097-3165(74)90025-9_BIB25","doi-asserted-by":"crossref","first-page":"116","DOI":"10.1016\/0095-8956(72)90048-2","article-title":"A two-connected planar graph without concurrent longest paths","volume":"13","author":"Zamfirescu","year":"1972","journal-title":"J. Combinatorial Theory Sect. B"}],"container-title":["Journal of Combinatorial Theory, Series A"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0097316574900259?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0097316574900259?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,4]],"date-time":"2019-02-04T03:20:07Z","timestamp":1549250407000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0097316574900259"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1974,7]]},"references-count":25,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1974,7]]}},"alternative-id":["0097316574900259"],"URL":"https:\/\/doi.org\/10.1016\/0097-3165(74)90025-9","relation":{},"ISSN":["0097-3165"],"issn-type":[{"value":"0097-3165","type":"print"}],"subject":[],"published":{"date-parts":[[1974,7]]}}}