{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,12]],"date-time":"2026-05-12T12:45:48Z","timestamp":1778589948419,"version":"3.51.4"},"reference-count":28,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[1973,4,1]],"date-time":"1973-04-01T00:00:00Z","timestamp":102470400000},"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":14717,"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":[[1973,4]]},"DOI":"10.1016\/0012-365x(73)90167-2","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:33:13Z","timestamp":1027654393000},"page":"305-337","source":"Crossref","is-referenced-by-count":425,"title":["Edmonds polytopes and a hierarchy of combinatorial problems"],"prefix":"10.1016","volume":"4","author":[{"given":"V.","family":"Chv\u00e1tal","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(73)90167-2_BIB1","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1287\/opre.16.2.442","article-title":"A note on the branch-and-bound principle","volume":"16","author":"Balas","year":"1968","journal-title":"Operations Res."},{"key":"10.1016\/0012-365X(73)90167-2_BIB2","series-title":"Graphes et hypergraphs","author":"Berge","year":"1970"},{"key":"10.1016\/0012-365X(73)90167-2_BIB3","doi-asserted-by":"crossref","first-page":"434","DOI":"10.2307\/2036470","article-title":"Hypergraphs and Ramseyian theorems","volume":"27","author":"Chv\u00e1tal","year":"1971","journal-title":"Proc. Am. Math. Soc."},{"key":"10.1016\/0012-365X(73)90167-2_BIB4","doi-asserted-by":"crossref","first-page":"19","DOI":"10.4153\/CMB-1972-004-8","article-title":"Remarks on a problem of Moser","volume":"15","author":"Chv\u00e1tal","year":"1972","journal-title":"Canad. Math. Bull."},{"key":"10.1016\/0012-365X(73)90167-2_BIB5","doi-asserted-by":"crossref","unstructured":"V. Chv\u00e1tal, Edmonds polytopes and weakly Hamiltonian graphs, Math. Programming, to appear.","DOI":"10.1007\/BF01580109"},{"key":"10.1016\/0012-365X(73)90167-2_BIB6","doi-asserted-by":"crossref","unstructured":"V. Chv\u00e1tal, On certain polytopes associated with graphs, submitted to J. Combin. Theory.","DOI":"10.1016\/0095-8956(75)90041-6"},{"key":"10.1016\/0012-365X(73)90167-2_BIB7","first-page":"151","article-title":"The complexity of theorem-proving procedures","author":"Cook","year":"1970","journal-title":"Conference record of third ACM symposium on theory of computing"},{"key":"10.1016\/0012-365X(73)90167-2_BIB8","doi-asserted-by":"crossref","first-page":"67","DOI":"10.6028\/jres.069B.004","article-title":"Minimum partition of a matroid into independent subsets","volume":"69","author":"Edmonds","year":"1965","journal-title":"J. Res. Nat. Bur. Standards Sect. B"},{"key":"10.1016\/0012-365X(73)90167-2_BIB9","doi-asserted-by":"crossref","first-page":"125","DOI":"10.6028\/jres.069B.013","article-title":"Maximum matching and a polyhedron with 0, 1-vertices","volume":"69","author":"Edmonds","year":"1965","journal-title":"J. Res. Nat. Bur. Standards Sect. B"},{"key":"10.1016\/0012-365X(73)90167-2_BIB10","doi-asserted-by":"crossref","first-page":"449","DOI":"10.4153\/CJM-1965-045-4","article-title":"Paths, tree and flowers","volume":"17","author":"Edmonds","year":"1965","journal-title":"Canad. J. Math."},{"key":"10.1016\/0012-365X(73)90167-2_BIB11","series-title":"Combinatorial structures and their applications","article-title":"Matching: A well-solved class of integer linear programs","author":"Edmonds","year":"1970"},{"key":"10.1016\/0012-365X(73)90167-2_BIB12","series-title":"Combinatorial structures and their applications","article-title":"Theoretical improvements in algorithmic efficiency for network flow problems","author":"Edmonds","year":"1970"},{"key":"10.1016\/0012-365X(73)90167-2_BIB13","doi-asserted-by":"crossref","first-page":"292","DOI":"10.1090\/S0002-9904-1947-08785-1","article-title":"Some remarks on the theory of graphs","volume":"53","author":"Erd\u00f6s","year":"1947","journal-title":"Bull. Amer. Math. Soc."},{"key":"10.1016\/0012-365X(73)90167-2_BIB14","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1016\/0095-8956(72)90032-9","article-title":"Anti-blocking polyhedra","volume":"12","author":"Fulkerson","year":"1972","journal-title":"J. Combin. Theory"},{"key":"10.1016\/0012-365X(73)90167-2_BIB15","series-title":"Theory of graphs","article-title":"On directed paths and circuits","author":"Gallai","year":"1968"},{"key":"10.1016\/0012-365X(73)90167-2_BIB16","article-title":"An algorithm for integer solutions to linear programs","author":"Gomory","year":"1958","journal-title":"Princeton IBM Math. Report"},{"key":"10.1016\/0012-365X(73)90167-2_BIB17","series-title":"Combinatorial theory","author":"Hall","year":"1967"},{"key":"10.1016\/0012-365X(73)90167-2_BIB18","series-title":"Linear inequalities and related systems","article-title":"Integral boundary points of convex polyhedra","volume":"38","author":"Hoffman","year":"1956"},{"key":"10.1016\/0012-365X(73)90167-2_BIB19","doi-asserted-by":"crossref","first-page":"122","DOI":"10.1109\/SWAT.1971.1","article-title":"A n52 algorithm for maximum matchings in bipartite graphs","author":"Hopcroft","year":"1971","journal-title":"Twelfth annual symposium on switching and automata theory"},{"key":"10.1016\/0012-365X(73)90167-2_BIB20","series-title":"Integer programming and network flows","author":"Hu","year":"1969"},{"key":"10.1016\/0012-365X(73)90167-2_BIB21","series-title":"Complexity of computer computations","article-title":"Reducibility among combinatorial problems","author":"Karp","year":"1972"},{"key":"10.1016\/0012-365X(73)90167-2_BIB22","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1016\/0012-365X(72)90006-4","article-title":"Normal hypergraphs and the perfect graph conjecture","volume":"2","author":"Lov\u00e1sz","year":"1972","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(73)90167-2_BIB23","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/0095-8956(72)90045-7","article-title":"A characterization of perfect graphs","volume":"13","author":"Lov\u00e1sz","year":"1972","journal-title":"J. Combin. Theory"},{"key":"10.1016\/0012-365X(73)90167-2_BIB24","first-page":"268","article-title":"Problem P. 170","volume":"13","author":"Moser","year":"1970","journal-title":"Canad. Math. Bull."},{"key":"10.1016\/0012-365X(73)90167-2_BIB25","series-title":"Thesis","article-title":"Solution characteristics and algorithms for the vertex-packing problem","author":"Trotter","year":"1973"},{"key":"10.1016\/0012-365X(73)90167-2_BIB26","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1112\/jlms\/s1-22.2.107","article-title":"The factorization of linear graphs","volume":"22","author":"Tutte","year":"1947","journal-title":"J. London Math. Soc."},{"key":"10.1016\/0012-365X(73)90167-2_BIB27","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1137\/1010063","article-title":"Integer extreme points","volume":"10","author":"Veinott","year":"1968","journal-title":"SIAM Review"},{"key":"10.1016\/0012-365X(73)90167-2_BIB28","series-title":"The electric kool-acid acid test","author":"Wolf","year":"1969"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X73901672?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X73901672?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T10:51:12Z","timestamp":1555152672000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X73901672"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1973,4]]},"references-count":28,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1973,4]]}},"alternative-id":["0012365X73901672"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(73)90167-2","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1973,4]]}}}