{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,30]],"date-time":"2025-06-30T11:26:32Z","timestamp":1751282792713},"reference-count":8,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1994,7,1]],"date-time":"1994-07-01T00:00:00Z","timestamp":773020800000},"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":6956,"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,7]]},"DOI":"10.1016\/0012-365x(92)00520-2","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:43:34Z","timestamp":1027655014000},"page":"39-55","source":"Crossref","is-referenced-by-count":4,"title":["Polyhedral consequences of the amalgam operation"],"prefix":"10.1016","volume":"130","author":[{"given":"M.","family":"Burlet","sequence":"first","affiliation":[]},{"given":"J.","family":"Fonlupt","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(92)00520-2_BIB1","first-page":"221","article-title":"A composition for perfect graphs","volume":"21","author":"Bixby","year":"1984"},{"key":"10.1016\/0012-365X(92)00520-2_BIB2","first-page":"225","article-title":"Polynomial algorithm to recognize a Meyniel graph","volume":"21","author":"Burlet","year":"1984"},{"key":"10.1016\/0012-365X(92)00520-2_BIB3","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":"Chvatal","year":"1975","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/0012-365X(92)00520-2_BIB4","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1016\/S0012-365X(85)80001-7","article-title":"Compositions for perfect graphs","volume":"55","author":"Cornu\u00e9jols","year":"1985","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(92)00520-2_BIB5","first-page":"57","article-title":"Polyhedra for composed independence systems","volume":"16","author":"Cunningham","year":"1982","journal-title":"Bonn Workshop on Combinatorial Optimization"},{"key":"10.1016\/0012-365X(92)00520-2_BIB6","series-title":"Geometric Algorithms and Combinatorial Optimization","author":"Gr\u00f6tschel","year":"1987"},{"key":"10.1016\/0012-365X(92)00520-2_BIB7","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/BF01580121","article-title":"On the facial structure of set packing polyhedra","volume":"5","author":"Padberg","year":"1973","journal-title":"Math. Programming"},{"key":"10.1016\/0012-365X(92)00520-2_BIB8","series-title":"Theory of Linear and Integer Programming","author":"Schrijver","year":"1986"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X92005202?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X92005202?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T06:20:23Z","timestamp":1555136423000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X92005202"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,7]]},"references-count":8,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1994,7]]}},"alternative-id":["0012365X92005202"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(92)00520-2","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1994,7]]}}}