{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:25:44Z","timestamp":1761611144818},"reference-count":11,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1985,1,1]],"date-time":"1985-01-01T00:00:00Z","timestamp":473385600000},"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":10424,"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":[[1985]]},"DOI":"10.1016\/s0012-365x(85)80001-7","type":"journal-article","created":{"date-parts":[[2005,1,5]],"date-time":"2005-01-05T12:28:25Z","timestamp":1104928105000},"page":"245-254","source":"Crossref","is-referenced-by-count":57,"title":["Compositions for perfect graphs"],"prefix":"10.1016","volume":"55","author":[{"given":"G.","family":"Cornu\u00e9jols","sequence":"first","affiliation":[]},{"given":"W.H.","family":"Cunningham","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0012-365X(85)80001-7_bib1","first-page":"114","article-title":"F\u00e4rbung von Graphen, deren s\u00e4mtliche bzw. deren ungerade Kreise stan sind","author":"Berge","year":"1961"},{"key":"10.1016\/S0012-365X(85)80001-7_bib2","series-title":"Graphs and Hypergraphs","author":"Berge","year":"1972"},{"key":"10.1016\/S0012-365X(85)80001-7_bib3","series-title":"Topics on Perfect Graphs","first-page":"221","article-title":"A composition for perfect graphs","volume":"21","author":"Bixby","year":"1984"},{"key":"10.1016\/S0012-365X(85)80001-7_bib4","series-title":"Topics on Perfect Graphs","first-page":"225","article-title":"Polynomial algorithm to recognize a Meyniel graph","volume":"21","author":"Burlet","year":"1984"},{"key":"10.1016\/S0012-365X(85)80001-7_bib5","series-title":"Proc. 3rd Southeastern Conference on Combinatorics","article-title":"Graph decomposition for undirected graphs","author":"Cowan","year":"1972"},{"key":"10.1016\/S0012-365X(85)80001-7_bib6","article-title":"A combinatorial decomposition theory","author":"Cunningham","year":"1973"},{"key":"10.1016\/S0012-365X(85)80001-7_bib7","doi-asserted-by":"crossref","first-page":"214","DOI":"10.1137\/0603021","article-title":"Decomposition of directed graphs","volume":"3","author":"Cunningham","year":"1982","journal-title":"SIAM. J. Algebraic Discrete Methods"},{"key":"10.1016\/S0012-365X(85)80001-7_bib8","doi-asserted-by":"crossref","first-page":"734","DOI":"10.4153\/CJM-1980-057-7","article-title":"A combinatorial decomposition theory","volume":"32","author":"Cunningham","year":"1980","journal-title":"Canad. J. Math."},{"key":"10.1016\/S0012-365X(85)80001-7_bib9","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\/S0012-365X(85)80001-7_bib10","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1016\/S0012-365X(76)80008-8","article-title":"On the perfect graph conjecture","volume":"16","author":"Meyniel","year":"1976","journal-title":"Discrete Math."},{"key":"10.1016\/S0012-365X(85)80001-7_bib11","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1016\/0020-0190(81)90072-7","article-title":"An algorithm for finding clique cutsets","volume":"12","author":"Whitesides","year":"1981","journal-title":"Inform. Process. Lett."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X85800017?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X85800017?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,30]],"date-time":"2019-01-30T11:59:07Z","timestamp":1548849547000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X85800017"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985]]},"references-count":11,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1985]]}},"alternative-id":["S0012365X85800017"],"URL":"https:\/\/doi.org\/10.1016\/s0012-365x(85)80001-7","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1985]]}}}