{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,20]],"date-time":"2025-09-20T18:54:57Z","timestamp":1758394497520},"reference-count":14,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1981,12,1]],"date-time":"1981-12-01T00:00:00Z","timestamp":376012800000},"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":11551,"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":[[1981,12]]},"DOI":"10.1016\/0095-8956(81)90032-0","type":"journal-article","created":{"date-parts":[[2005,2,9]],"date-time":"2005-02-09T09:37:08Z","timestamp":1107941828000},"page":"297-312","source":"Crossref","is-referenced-by-count":25,"title":["Hamiltonicity and combinatorial polyhedra"],"prefix":"10.1016","volume":"31","author":[{"given":"D","family":"Naddef","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"W.R","family":"Pulleyblank","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0095-8956(81)90032-0_BIB1","doi-asserted-by":"crossref","first-page":"516","DOI":"10.1137\/1016083","article-title":"On the assignment polytope","volume":"16","author":"Balinski","year":"1974","journal-title":"SIAM Rev."},{"key":"10.1016\/0095-8956(81)90032-0_BIB2","series-title":"Graphes et hypergraphes","author":"Berge","year":"1973"},{"key":"10.1016\/0095-8956(81)90032-0_BIB3","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1016\/0095-8956(77)90010-7","article-title":"Convex polyhedra of doubly stochastic matrices. II. Graph of \u03c9n","volume":"22","author":"Brualdi","year":"1977","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/0095-8956(81)90032-0_BIB4","author":"Capobianco","year":"1978"},{"key":"10.1016\/0095-8956(81)90032-0_BIB5","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1016\/0095-8956(72)90020-2","article-title":"On Hamilton's ideals","volume":"12","author":"Chv\u00e1tal","year":"1972","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/0095-8956(81)90032-0_BIB6","doi-asserted-by":"crossref","first-page":"138","DOI":"10.1016\/0095-8956(75)90041-6","article-title":"On certain polytopes associated with graphs","volume":"18","author":"Chv\u00e1tal","year":"1975","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/0095-8956(81)90032-0_BIB7","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1109\/TCT.1966.1082546","article-title":"Hamilton circuits in tree graphs","volume":"13","author":"Cummings","year":"1966","journal-title":"IEEE Trans. Circuit Theory"},{"key":"10.1016\/0095-8956(81)90032-0_BIB8","doi-asserted-by":"crossref","first-page":"106","DOI":"10.1007\/BFb0121197","article-title":"Colouring criteria for adjacency on 0\u20131 polyhedra","volume":"8","author":"Hausmann","year":"1978","journal-title":"Math. Programming Study"},{"key":"10.1016\/0095-8956(81)90032-0_BIB9","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1137\/0122021","article-title":"On the tree graph of a matroid","volume":"22","author":"Holzmann","year":"1972","journal-title":"SIAM J. Appl. Math."},{"key":"10.1016\/0095-8956(81)90032-0_BIB10","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1016\/0095-8956(73)90005-1","article-title":"Matroid basis graphs, I","volume":"14","author":"Maurer","year":"1973","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/0095-8956(81)90032-0_BIB11","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1016\/0095-8956(73)90013-0","article-title":"Matroid basis graphs, II","volume":"15","author":"Maurer","year":"1973","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/0095-8956(81)90032-0_BIB12","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1109\/TCT.1968.1082765","article-title":"Note on Hamilton circuits in tree graphs","volume":"15","author":"Shank","year":"1968","journal-title":"IEEE Trans. Circuit Theory"},{"key":"10.1016\/0095-8956(81)90032-0_BIB13","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(81)90032-0_BIB14","doi-asserted-by":"crossref","first-page":"128","DOI":"10.1007\/BFb0121198","article-title":"On permutations and permutation polytopes","volume":"8","author":"Young","year":"1978","journal-title":"Math. Programming Study"}],"container-title":["Journal of Combinatorial Theory, Series B"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0095895681900320?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0095895681900320?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,29]],"date-time":"2019-01-29T11:23:16Z","timestamp":1548760996000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0095895681900320"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1981,12]]},"references-count":14,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1981,12]]}},"alternative-id":["0095895681900320"],"URL":"https:\/\/doi.org\/10.1016\/0095-8956(81)90032-0","relation":{},"ISSN":["0095-8956"],"issn-type":[{"value":"0095-8956","type":"print"}],"subject":[],"published":{"date-parts":[[1981,12]]}}}