{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,14]],"date-time":"2026-06-14T05:40:15Z","timestamp":1781415615249,"version":"3.54.1"},"reference-count":13,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1986,6,1]],"date-time":"1986-06-01T00:00:00Z","timestamp":517968000000},"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":9908,"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":[[1986,6]]},"DOI":"10.1016\/0095-8956(86)90087-0","type":"journal-article","created":{"date-parts":[[2004,12,21]],"date-time":"2004-12-21T20:35:48Z","timestamp":1103661348000},"page":"330-343","source":"Crossref","is-referenced-by-count":75,"title":["Relaxations of vertex packing"],"prefix":"10.1016","volume":"40","author":[{"given":"M","family":"Gr\u00f6tschel","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"L","family":"Lov\u00e1sz","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"A","family":"Schrijver","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/0095-8956(86)90087-0_BIB1","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1016\/0012-365X(79)90160-2","article-title":"Polytope des ind\u00e9pendents d'un graphe s\u00e9ries-parall\u00e8le","volume":"27","author":"Boulala","year":"1979","journal-title":"Discrete Math."},{"key":"10.1016\/0095-8956(86)90087-0_BIB2","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(86)90087-0_BIB3","first-page":"16","article-title":"On combinatorial properties of matrices (Hungarian)","volume":"38","author":"Egerv\u00e1ry","year":"1931","journal-title":"Mat. Lapok"},{"key":"10.1016\/0095-8956(86)90087-0_BIB4","first-page":"83","article-title":"Transformations which preserve perfectness and h-herfectness of graphs","volume":"16","author":"Fonlupt","year":"1982","journal-title":"Ann. Discrete Math."},{"key":"10.1016\/0095-8956(86)90087-0_BIB5","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1007\/BF01584085","article-title":"Blocking and anti-blocking pairs of polyhedra","volume":"1","author":"Fulkerson","year":"1971","journal-title":"Math. Programming"},{"key":"10.1016\/0095-8956(86)90087-0_BIB6","series-title":"Mathematical Programming","first-page":"69","article-title":"On the perfect graph theorem","author":"Fulkerson","year":"1973"},{"key":"10.1016\/0095-8956(86)90087-0_BIB7","series-title":"Matrices with the Edmonds-Johnson property","author":"Gerards","year":"1984"},{"key":"10.1016\/0095-8956(86)90087-0_BIB8","author":"Golumbic","year":"1980"},{"key":"10.1016\/0095-8956(86)90087-0_BIB9","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/BF02579273","article-title":"The ellipsoid method and its consequences in combinatorial optimization","volume":"1","author":"Gr\u00f6tschel","year":"1981","journal-title":"Combinatorica"},{"key":"10.1016\/0095-8956(86)90087-0_BIB10","first-page":"325","article-title":"Polynomial algorithms for perfect graphs","volume":"21","author":"Gr\u00f6tschel","year":"1984","journal-title":"Ann. Discrete Math."},{"key":"10.1016\/0095-8956(86)90087-0_BIB11","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\/0095-8956(86)90087-0_BIB12","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1109\/TIT.1979.1055985","article-title":"On the Shannon capacity of a graph","volume":"25","author":"Lov\u00e1sz","year":"1979","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/0095-8956(86)90087-0_BIB13","series-title":"More Selected Topics in Graph Theory","first-page":"55","article-title":"Perfect graphs","author":"Lov\u00e1sz","year":"1983"}],"container-title":["Journal of Combinatorial Theory, Series B"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0095895686900870?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0095895686900870?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,30]],"date-time":"2019-01-30T15:52:16Z","timestamp":1548863536000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0095895686900870"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986,6]]},"references-count":13,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1986,6]]}},"alternative-id":["0095895686900870"],"URL":"https:\/\/doi.org\/10.1016\/0095-8956(86)90087-0","relation":{},"ISSN":["0095-8956"],"issn-type":[{"value":"0095-8956","type":"print"}],"subject":[],"published":{"date-parts":[[1986,6]]}}}