{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T21:25:16Z","timestamp":1762032316842},"reference-count":18,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1994,4,1]],"date-time":"1994-04-01T00:00:00Z","timestamp":765158400000},"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":7047,"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":[[1994,4]]},"DOI":"10.1016\/0012-365x(94)90115-5","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:43:34Z","timestamp":1027640614000},"page":"237-245","source":"Crossref","is-referenced-by-count":12,"title":["The antipodal layers problem"],"prefix":"10.1016","volume":"128","author":[{"given":"Glenn","family":"Hurlbert","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(94)90115-5_BIB1","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1016\/0095-8956(73)90001-4","article-title":"Lexicographic matching in Boolean algebras","volume":"14","author":"Aigner","year":"1973","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/0012-365X(94)90115-5_BIB2","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1002\/jgt.3190030314","article-title":"Long cycles in vertex transitive graphs","volume":"3","author":"Babai","year":"1979","journal-title":"J. Graph Theory"},{"key":"10.1016\/0012-365X(94)90115-5_BIB3","series-title":"Algebraic Graph Theory","author":"Biggs","year":"1974"},{"key":"10.1016\/0012-365X(94)90115-5_BIB4","first-page":"3","article-title":"Hamiltonian cycles in graphs and digraphs","author":"Bondy","year":"1978","journal-title":"Proc. 9th S.E. Conf. Combinatorics, Graph Theory, and Computing"},{"key":"10.1016\/0012-365X(94)90115-5_BIB5","first-page":"54","article-title":"Graph Theory with Applications","author":"Bondy","year":"1976"},{"key":"10.1016\/0012-365X(94)90115-5_BIB6","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/0012-365X(88)90194-X","article-title":"Two Hamiltonian cycles in bipartite reflective Kneser graphs","volume":"72","author":"C\u00f3rdoba","year":"1988","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(94)90115-5_BIB7","series-title":"Graph Theory and Applications to Algorithms and Computer Science","first-page":"189","article-title":"Hamiltonian cycles and quotients of bipartite graphs","author":"Dejter","year":"1985"},{"key":"10.1016\/0012-365X(94)90115-5_BIB8","unstructured":"D. Duffus, P. Hanlon and R. Roth, Matchings and Hamiltonian cycles in some families of symmetric graphs, J. Combin. Theory Ser. B, to appear."},{"key":"10.1016\/0012-365X(94)90115-5_BIB9","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1007\/BF00337620","article-title":"Lexicographic matchings cannot form Hamiltonian cycles","volume":"5","author":"Duffus","year":"1988","journal-title":"Order"},{"key":"10.1016\/0012-365X(94)90115-5_BIB10","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1016\/0012-365X(80)90253-8","article-title":"More odd graph theory","volume":"32","author":"Godsil","year":"1980","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(94)90115-5_BIB11","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1002\/jgt.3190150204","article-title":"Updating the Hamiltonian problem \u2013 a survey","volume":"15","author":"Gould","year":"1991","journal-title":"J. Graph Theory"},{"key":"10.1016\/0012-365X(94)90115-5_BIB12","series-title":"Graphs and other Combinatorial Topics","first-page":"101","article-title":"Semipaths in directed cubes","author":"H\u00e1vel","year":"1982"},{"key":"10.1016\/0012-365X(94)90115-5_BIB13","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/0095-8956(80)90042-8","article-title":"Hamiltonian cycles in regular 2-connected graphs","volume":"29","author":"Jackson","year":"1980","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/0012-365X(94)90115-5_BIB14","series-title":"Graphs and Order: The Role of Graphs in the Theory of Ordered Sets and its Applications","first-page":"530","article-title":"Problem 2.5","author":"Kelly","year":"1985"},{"key":"10.1016\/0012-365X(94)90115-5_BIB15","first-page":"163","volume":"5","author":"Kierstead","year":"1988","journal-title":"Explicit matchings in the middle levels of the Boolean lattice"},{"key":"10.1016\/0012-365X(94)90115-5_BIB16","series-title":"Combinatorial Structures and their Applications","first-page":"497","article-title":"Problem 11","author":"Lov\u00e1sz","year":"1970"},{"key":"10.1016\/0012-365X(94)90115-5_BIB17","unstructured":"D. Moews and M. Reid, personal communication."},{"key":"10.1016\/0012-365X(94)90115-5_BIB18","unstructured":"C. Savage, personal communication."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X94901155?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X94901155?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T01:58:19Z","timestamp":1555120699000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X94901155"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,4]]},"references-count":18,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1994,4]]}},"alternative-id":["0012365X94901155"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(94)90115-5","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1994,4]]}}}