{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,2]],"date-time":"2026-05-02T03:38:15Z","timestamp":1777693095456,"version":"3.51.4"},"reference-count":23,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1976,10,1]],"date-time":"1976-10-01T00:00:00Z","timestamp":212976000000},"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":13438,"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":[[1976,10]]},"DOI":"10.1016\/0095-8956(76)90051-4","type":"journal-article","created":{"date-parts":[[2004,12,22]],"date-time":"2004-12-22T01:34:55Z","timestamp":1103679295000},"page":"116-131","source":"Crossref","is-referenced-by-count":10,"title":["Pairs of Hamiltonian circuits in 5-connected planar graphs"],"prefix":"10.1016","volume":"21","author":[{"given":"Joseph","family":"Zaks","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0095-8956(76)90051-4_BIB1","author":"Berge","year":"1973"},{"key":"10.1016\/0095-8956(76)90051-4_BIB2","series-title":"Proc. Int. Seminar on Graph Theory and its Applications","first-page":"35","article-title":"Hamiltonian lines in cubic graphs","author":"Bos\u00e1k","year":"1966"},{"key":"10.1016\/0095-8956(76)90051-4_BIB3","doi-asserted-by":"crossref","first-page":"1211","DOI":"10.2140\/pjm.1961.11.1211","article-title":"Simple paths on convex polyhedra","volume":"11","author":"Brown","year":"1961","journal-title":"Pacific J. Math."},{"key":"10.1016\/0095-8956(76)90051-4_BIB4","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. Combinatorial Theory Ser. B"},{"issue":"No. 2","key":"10.1016\/0095-8956(76)90051-4_BIB5","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."},{"key":"10.1016\/0095-8956(76)90051-4_BIB6","first-page":"51","article-title":"Plane homogeneous graphs of degree three without Hamiltonian circuits (Russian)","volume":"Vol. 4","author":"Grinberg","year":"1968"},{"key":"10.1016\/0095-8956(76)90051-4_BIB7","author":"Gr\u00fcnbaum","year":"1967"},{"key":"10.1016\/0095-8956(76)90051-4_BIB8","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(76)90051-4_BIB9","unstructured":"B. Gr\u00fcnbaum and J. Malkevitch, Pairs of edge-disjoint Hamiltonian circuits, to appear."},{"key":"10.1016\/0095-8956(76)90051-4_BIB10","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1016\/0012-365X(74)90022-3","article-title":"The existence of certain planar maps","volume":"10","author":"Gr\u00fcnbaum","year":"1974","journal-title":"Discrete Math."},{"key":"10.1016\/0095-8956(76)90051-4_BIB11","doi-asserted-by":"crossref","unstructured":"P. Martin, Cycles Hamiltoniens dans les graphs 4-r\u00e9guliers 4-connexes, Aequationes Math., to appear.","DOI":"10.1007\/BF01836203"},{"key":"10.1016\/0095-8956(76)90051-4_BIB12","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1016\/S0095-8956(73)80006-1","article-title":"Regular n-valent n-connected non-Hamiltonian non-n-edge colorable graphs","volume":"14","author":"Meredith","year":"1973","journal-title":"J. Combinatorial Theory Ser. B"},{"key":"10.1016\/0095-8956(76)90051-4_BIB13","series-title":"Combinatorial Mathematics and its Applications","first-page":"191","article-title":"Possible directions in graph theory","author":"Nash-Williams","year":"1971"},{"key":"10.1016\/0095-8956(76)90051-4_BIB14","series-title":"Combinatorial Theory and its Applications","article-title":"Hamiltonian lines in graphs whose vertices have sufficiently large valencies","author":"Nash-Williams","year":"1970"},{"key":"10.1016\/0095-8956(76)90051-4_BIB15","series-title":"Studies in Pure Mathematics","article-title":"Edge-disjoint Hamiltonian circuits in graphs with vertices of large valency","author":"Nash-Williams","year":"1971"},{"key":"10.1016\/0095-8956(76)90051-4_BIB16","article-title":"The four color problem","volume":"Vol. 27","author":"Ore","year":"1967"},{"key":"10.1016\/0095-8956(76)90051-4_BIB17","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1007\/BF02392606","article-title":"Die Theorie der regul\u00e4ren Graphen","volume":"15","author":"Petersen","year":"1891","journal-title":"Acta Math."},{"key":"10.1016\/0095-8956(76)90051-4_BIB18","series-title":"Theorie des Graphes ICC","first-page":"373","article-title":"Construction of non-Hamiltonian planar regular graphs of degrees 3, 4, 5","author":"Sachs","year":"1967"},{"key":"10.1016\/0095-8956(76)90051-4_BIB19","doi-asserted-by":"crossref","first-page":"98","DOI":"10.1112\/jlms\/s1-21.2.98","article-title":"On Hamiltonian circuits","volume":"21","author":"Tutte","year":"1946","journal-title":"J. London Math. Soc."},{"key":"10.1016\/0095-8956(76)90051-4_BIB20","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(76)90051-4_BIB21","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1002\/mana.19690390407","article-title":"\u00dcber das Problem der Existenz von Hamiltonkreisen in planaren, regul\u00e4ren Graphen","volume":"39","author":"Walther","year":"1969","journal-title":"Math. Nachr."},{"key":"10.1016\/0095-8956(76)90051-4_BIB22","doi-asserted-by":"crossref","first-page":"378","DOI":"10.2307\/1968197","article-title":"A theorem on graphs","volume":"32","author":"Whitney","year":"1931","journal-title":"Ann. of Math."},{"key":"10.1016\/0095-8956(76)90051-4_BIB23","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1016\/0095-8956(71)90027-X","article-title":"On the 1-factors of n-connected graphs","volume":"11","author":"Zaks","year":"1971","journal-title":"J. Combinatorial Theory"}],"container-title":["Journal of Combinatorial Theory, Series B"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0095895676900514?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0095895676900514?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,30]],"date-time":"2019-01-30T19:50:26Z","timestamp":1548877826000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0095895676900514"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1976,10]]},"references-count":23,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1976,10]]}},"alternative-id":["0095895676900514"],"URL":"https:\/\/doi.org\/10.1016\/0095-8956(76)90051-4","relation":{},"ISSN":["0095-8956"],"issn-type":[{"value":"0095-8956","type":"print"}],"subject":[],"published":{"date-parts":[[1976,10]]}}}