{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,3,29]],"date-time":"2024-03-29T23:31:29Z","timestamp":1711755089257},"reference-count":14,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1987,8,1]],"date-time":"1987-08-01T00:00:00Z","timestamp":554774400000},"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":9482,"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":[[1987,8]]},"DOI":"10.1016\/0095-8956(87)90031-1","type":"journal-article","created":{"date-parts":[[2005,2,9]],"date-time":"2005-02-09T14:37:08Z","timestamp":1107959828000},"page":"70-94","source":"Crossref","is-referenced-by-count":16,"title":["Decomposition of perfect graphs"],"prefix":"10.1016","volume":"43","author":[{"given":"Wen-Lian","family":"Hsu","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0095-8956(87)90031-1_BIB1","first-page":"114","article-title":"deren samtliche bzw, deren ungerade Kreise starr sind","author":"Berge","year":"1961","journal-title":"Wiss. Z. Martin-Luther-Univ. Halle-Wittenberg. Math.-Natur, Reihe"},{"key":"10.1016\/0095-8956(87)90031-1_BIB2","series-title":"Comm. 13ieme Assembl\u00e9e Gen. URSI","article-title":"Sur une conjecture relative au probl\u00e8me des codes optimaux","author":"Berge","year":"1962"},{"key":"10.1016\/0095-8956(87)90031-1_BIB3","series-title":"Topics on Perfect Graphs","first-page":"57","article-title":"A composition for perfect graphs","volume":"21","author":"Bixby","year":"1984"},{"key":"10.1016\/0095-8956(87)90031-1_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\/0095-8956(87)90031-1_BIB5","series-title":"Topics on Perfect Graphs","first-page":"63","article-title":"Perfectly ordered graphs","volume":"21","author":"Chv\u00e1tal","year":"1984"},{"key":"10.1016\/0095-8956(87)90031-1_BIB6","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/0095-8956(85)90049-8","article-title":"Star-cutsets and perfect graphs","volume":"39","author":"Chv\u00e1tal","year":"1985","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/0095-8956(87)90031-1_BIB7","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1016\/S0012-365X(85)80001-7","article-title":"Compositions for perfect graphs","volume":"55","author":"Cornuejols","year":"1985","journal-title":"Discrete Math."},{"key":"10.1016\/0095-8956(87)90031-1_BIB8","article-title":"Transformations which preserve perfection and H-perfection of graphs","author":"Fonlupt","year":"1982","journal-title":"Scientific and Medical University of Grenoble, Research report"},{"key":"10.1016\/0095-8956(87)90031-1_BIB9","doi-asserted-by":"crossref","DOI":"10.1007\/BF02579263","article-title":"Coloring planar perfect graphs by decomposition","author":"Hsu","year":"1986","journal-title":"Combinatorica"},{"key":"10.1016\/0095-8956(87)90031-1_BIB10","doi-asserted-by":"crossref","DOI":"10.1145\/23005.31330","article-title":"Recognizing planar perfect graphs","author":"Hsu","year":"1987","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0095-8956(87)90031-1_BIB11","article-title":"An O(n3) algorithm for the maximum independent set problem on planar perfect graphs","author":"Hsu","year":"1985","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0095-8956(87)90031-1_BIB12","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(87)90031-1_BIB13","first-page":"115","article-title":"Uber die Uberdeckung von Graphen mit Cliquen","volume":"15","author":"Olaru","year":"1969","journal-title":"Wiss. Z. Tech. Hochsch. Ilmenau"},{"key":"10.1016\/0095-8956(87)90031-1_BIB14","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1016\/0095-8956(77)90064-8","article-title":"Critical perfect graphs and perfect 3-chromatic graphs","volume":"23","author":"Tucker","year":"1977","journal-title":"J. Combin. Theory Ser. B"}],"container-title":["Journal of Combinatorial Theory, Series B"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0095895687900311?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0095895687900311?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,29]],"date-time":"2019-01-29T15:54:56Z","timestamp":1548777296000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0095895687900311"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987,8]]},"references-count":14,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1987,8]]}},"alternative-id":["0095895687900311"],"URL":"https:\/\/doi.org\/10.1016\/0095-8956(87)90031-1","relation":{},"ISSN":["0095-8956"],"issn-type":[{"value":"0095-8956","type":"print"}],"subject":[],"published":{"date-parts":[[1987,8]]}}}