{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,15]],"date-time":"2024-07-15T09:47:00Z","timestamp":1721036820590},"reference-count":10,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1988,4,1]],"date-time":"1988-04-01T00:00:00Z","timestamp":575856000000},"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":9238,"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":[[1988,4]]},"DOI":"10.1016\/0095-8956(88)90085-8","type":"journal-article","created":{"date-parts":[[2004,12,22]],"date-time":"2004-12-22T01:35:48Z","timestamp":1103679348000},"page":"154-176","source":"Crossref","is-referenced-by-count":57,"title":["Recognizing claw-free perfect graphs"],"prefix":"10.1016","volume":"44","author":[{"given":"V","family":"Chv\u00e1tal","sequence":"first","affiliation":[]},{"given":"N","family":"Sbihi","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0095-8956(88)90085-8_BIB1","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(88)90085-8_BIB2","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1007\/BF02992776","article-title":"On rigid circuit graphs","volume":"25","author":"Dirac","year":"1961","journal-title":"Abh. Math. Sem. Univ. Hamburg"},{"key":"10.1016\/0095-8956(88)90085-8_BIB3","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1007\/BF02020961","article-title":"Transitiv orientierbare Graphen","volume":"18","author":"Gallai","year":"1967","journal-title":"Acta Math. Acad. Sci. Hungar."},{"key":"10.1016\/0095-8956(88)90085-8_BIB4","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1016\/0012-365X(77)90030-9","article-title":"Algorithms on clique separable graphs","volume":"19","author":"Gavril","year":"1977","journal-title":"Discrete Math."},{"key":"10.1016\/0095-8956(88)90085-8_BIB5","first-page":"19","article-title":"Line graphs of bipartite graphs","volume":"1","author":"Harary","year":"1974","journal-title":"Rev. Soc. Mat. Chile"},{"key":"10.1016\/0095-8956(88)90085-8_BIB6","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1016\/0095-8956(85)90050-4","article-title":"Weakly triangulated graphs","volume":"39","author":"Hayward","year":"1985","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/0095-8956(88)90085-8_BIB7","doi-asserted-by":"crossref","first-page":"212","DOI":"10.1016\/S0095-8956(76)80005-6","article-title":"The strong perfect graph conjecture is true for K1,3-free graphs","volume":"21","author":"Parthasarathy","year":"1976","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/0095-8956(88)90085-8_BIB8","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1016\/0095-8956(80)90075-1","article-title":"Decomposition of regular matroids","volume":"28","author":"Seymour","year":"1980","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/0095-8956(88)90085-8_BIB9","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1016\/0020-0190(81)90072-7","article-title":"An algorithm for finding clique cut-sets","volume":"12","author":"Whitesides","year":"1981","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0095-8956(88)90085-8_BIB10","series-title":"Topics on Perfect Graphs","first-page":"281","article-title":"A method for solving certain graph recognition and optimization problems, with applications to perfect graphs","volume":"21","author":"Whitesides","year":"1984"}],"container-title":["Journal of Combinatorial Theory, Series B"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0095895688900858?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0095895688900858?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,30]],"date-time":"2019-01-30T20:51:53Z","timestamp":1548881513000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0095895688900858"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988,4]]},"references-count":10,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1988,4]]}},"alternative-id":["0095895688900858"],"URL":"https:\/\/doi.org\/10.1016\/0095-8956(88)90085-8","relation":{},"ISSN":["0095-8956"],"issn-type":[{"value":"0095-8956","type":"print"}],"subject":[],"published":{"date-parts":[[1988,4]]}}}