{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T11:30:10Z","timestamp":1648639810228},"reference-count":24,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2002,3,1]],"date-time":"2002-03-01T00:00:00Z","timestamp":1014940800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["European Journal of Operational Research"],"published-print":{"date-parts":[[2002,3]]},"DOI":"10.1016\/s0377-2217(01)00213-2","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T10:08:03Z","timestamp":1027591683000},"page":"326-335","source":"Crossref","is-referenced-by-count":0,"title":["Quasi-star-cutsets and some consequences"],"prefix":"10.1016","volume":"137","author":[{"given":"A.","family":"Zemirline","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0377-2217(01)00213-2_BIB1","first-page":"123","article-title":"Les probl\u00e8mes de coloration en th\u00e9orie des graphes","volume":"9","author":"Berge","year":"1960","journal-title":"Publications de l'Institut de Statistique de l'Universit\u00e9 de Paris"},{"key":"10.1016\/S0377-2217(01)00213-2_BIB2","doi-asserted-by":"crossref","unstructured":"C. Berge, V. Chv\u00e1tal (Eds.), Topics on perfect graphs, in: Annals of Discrete Mathematics, North-Holland, Amsterdam, vol. 21, 1984","DOI":"10.1016\/S0304-0208(08)72921-9"},{"key":"10.1016\/S0377-2217(01)00213-2_BIB3","doi-asserted-by":"crossref","unstructured":"M. Burlet, J. Fonlupt, Polynomial Algorithm to Recognize a Meyniel Graph, in: Annals of Discrete Mathematics, North-Holland, Amsterdam, vol. 21, 1984","DOI":"10.1016\/S0304-0208(08)72938-4"},{"key":"10.1016\/S0377-2217(01)00213-2_BIB4","doi-asserted-by":"crossref","unstructured":"R.E. Bixby, A Composition for Perfect Graphs, in: Annals of Discrete Mathematics, North-Holland, Amsterdam, vol. 21, 1984","DOI":"10.1016\/S0304-0208(08)72937-2"},{"key":"10.1016\/S0377-2217(01)00213-2_BIB5","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":"Journal of Combinatorial Theory B"},{"key":"10.1016\/S0377-2217(01)00213-2_BIB6","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 Mathematics"},{"key":"10.1016\/S0377-2217(01)00213-2_BIB7","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":"Canadian Journal of Mathematics"},{"key":"10.1016\/S0377-2217(01)00213-2_BIB8","doi-asserted-by":"crossref","unstructured":"V. Chv\u00e1tal, J. Fonlupt, L. Sun, A. Zemirline, Recognizing dart-free perfect graphs, SIAM Journal of Computing (to appear)","DOI":"10.1137\/S0097539799354771"},{"key":"10.1016\/S0377-2217(01)00213-2_BIB9","first-page":"167","article-title":"A characterization of perfect K4\u2212e-free graphs","volume":"1","author":"Fonlupt","year":"1992","journal-title":"Rev. Maghr\u00e9bine Math."},{"key":"10.1016\/S0377-2217(01)00213-2_BIB10","first-page":"1","article-title":"A polynomial recognition algorithm for perfect K4\u2212e-free graphs","volume":"2","author":"Fonlupt","year":"1993","journal-title":"Rev. Maghr\u00e9bine Math."},{"key":"10.1016\/S0377-2217(01)00213-2_BIB11","series-title":"Algorithmic Graph Theory and Perfect Graphs","author":"Golumbic","year":"1980"},{"key":"10.1016\/S0377-2217(01)00213-2_BIB12","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1016\/0012-365X(95)00156-Q","article-title":"Some properties of minimal imperfect graphs","volume":"160","author":"Ho\u00e0ng","year":"1996","journal-title":"Discrete Mathematics"},{"key":"10.1016\/S0377-2217(01)00213-2_BIB13","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":"Journal of Combinatorial Theory B"},{"key":"10.1016\/S0377-2217(01)00213-2_BIB14","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1007\/BF01788689","article-title":"Optimizing weakly triangulated graphs","volume":"5","author":"Hayward","year":"1989","journal-title":"Graphs and Combinatorics"},{"key":"10.1016\/S0377-2217(01)00213-2_BIB15","unstructured":"S. Hougardy, Perfekte Graphen, Diplomarbeit, Forschunginstitut f\u00fcr Diskrete Mathematik, Universit\u00e4t Bonn, 1991"},{"key":"10.1016\/S0377-2217(01)00213-2_BIB16","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 Mathematics"},{"key":"10.1016\/S0377-2217(01)00213-2_BIB17","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1016\/S0195-6698(87)80037-9","article-title":"A new property of critical imperfect graphs and some consequences","volume":"8","author":"Meyniel","year":"1987","journal-title":"European Journal of Combinatories"},{"key":"10.1016\/S0377-2217(01)00213-2_BIB18","doi-asserted-by":"crossref","first-page":"244","DOI":"10.1016\/0095-8956(89)90024-5","article-title":"A new conjecture about minimal imperfect graphs","volume":"47","author":"Meyniel","year":"1989","journal-title":"Journal of Combinatorial Theory B"},{"key":"10.1016\/S0377-2217(01)00213-2_BIB19","doi-asserted-by":"crossref","first-page":"98","DOI":"10.1016\/0095-8956(79)90047-9","article-title":"The validity of the strong perfect graph conjecture for (K4\u2212e)-free graphs","volume":"26","author":"Parthasarathy","year":"1979","journal-title":"Journal of Combinatorial Theory B"},{"issue":"1","key":"10.1016\/S0377-2217(01)00213-2_BIB20","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1002\/(SICI)1097-0118(199609)23:1<77::AID-JGT9>3.0.CO;2-H","article-title":"On the connectivity of minimal imperfect graphs","volume":"23","author":"Seb\u00f6","year":"1996","journal-title":"Journal of Graph Theory"},{"key":"10.1016\/S0377-2217(01)00213-2_BIB21","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1016\/0095-8956(91)90078-X","article-title":"Two classes of perfect graphs","volume":"53","author":"Sun","year":"1991","journal-title":"Journal of Combinatorial Theory B"},{"key":"10.1016\/S0377-2217(01)00213-2_BIB22","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1016\/0095-8956(87)90048-7","article-title":"Coloring perfect (K4\u2212e)-free graphs","volume":"42","author":"Tucker","year":"1987","journal-title":"Journal of Combinatorial Theory B"},{"key":"10.1016\/S0377-2217(01)00213-2_BIB23","doi-asserted-by":"crossref","first-page":"258","DOI":"10.1016\/0095-8956(83)90039-4","article-title":"Coloring graphs with stable cutsets","volume":"34","author":"Tucker","year":"1983","journal-title":"Journal of Combinatorial Theory B"},{"key":"10.1016\/S0377-2217(01)00213-2_BIB24","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":"Journal of Combinatorial Theory B"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221701002132?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221701002132?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T01:50:10Z","timestamp":1578448210000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221701002132"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,3]]},"references-count":24,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2002,3]]}},"alternative-id":["S0377221701002132"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(01)00213-2","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2002,3]]}}}