{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T22:37:01Z","timestamp":1648593421399},"reference-count":14,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1992,8,1]],"date-time":"1992-08-01T00:00:00Z","timestamp":712627200000},"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":7655,"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":[[1992,8]]},"DOI":"10.1016\/0012-365x(92)90134-2","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:43:34Z","timestamp":1027655014000},"page":"93-102","source":"Crossref","is-referenced-by-count":3,"title":["On slim graphs, even pairs, and star-cutsets"],"prefix":"10.1016","volume":"105","author":[{"given":"Ch\u00ednh T.","family":"Ho\u00e0ng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fr\u00e9d\u00e9ric","family":"Maffray","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(92)90134-2_BIB1","first-page":"114","article-title":"F\u00e4rbung von Graphen, deren s\u00e4mtliche bzw. deren unegrade Kreise starr sind (Zusammenfassung)","volume":"10","author":"Berge","year":"1961","journal-title":"Wiss. Z. Martin-Luther-Univ. Halle-Wittenberg Math.-Natur. Reihe"},{"key":"10.1016\/0012-365X(92)90134-2_BIB2","first-page":"123","article-title":"Les probl\u00e8mes de coloration en th\u00e9orie des graphes","volume":"9","author":"Berge","year":"1960"},{"key":"10.1016\/0012-365X(92)90134-2_BIB3","article-title":"Polynomial algorithm to recognize a Meyniel graph","volume":"Vol. 21","author":"Burlet","year":"1984"},{"key":"10.1016\/0012-365X(92)90134-2_BIB4","article-title":"Parity graphs","volume":"Vol. 21","author":"Burlet","year":"1984"},{"key":"10.1016\/0012-365X(92)90134-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":"J. Combin. Theory Ser. B"},{"key":"10.1016\/0012-365X(92)90134-2_BIB6","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\/0012-365X(92)90134-2_BIB7","first-page":"3","article-title":"Graphen mit triangulierbaren ungeraden Vielecken","volume":"7","author":"Gallai","year":"1962","journal-title":"Magyar Tud. Akad. Mat. Kutato Int. K\u00f6zl."},{"key":"10.1016\/0012-365X(92)90134-2_BIB8","first-page":"113","article-title":"\u00dcber die Aufl\u00f6sung von Graphen in vollst\u00e4ndige Teilgraphen","volume":"1","author":"Hajnal","year":"1958","journal-title":"Ann. Univ. Sci. Budapest."},{"key":"10.1016\/0012-365X(92)90134-2_BIB9","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1007\/BF01788666","article-title":"Slim graphs","volume":"5","author":"Hertz","year":"1989","journal-title":"Graphs and Combinatorics"},{"key":"10.1016\/0012-365X(92)90134-2_BIB10","doi-asserted-by":"crossref","first-page":"263","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\/0012-365X(92)90134-2_BIB11","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1016\/S0195-6698(87)80037-9","article-title":"A property of critical imperfect graphs and some consequences","volume":"8","author":"Meyniel","year":"1987","journal-title":"Europ. J. Combin."},{"key":"10.1016\/0012-365X(92)90134-2_BIB12","doi-asserted-by":"crossref","first-page":"334","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\/0012-365X(92)90134-2_BIB13","first-page":"115","article-title":"\u00dcber die \u00dcberdeckung von Graphen mit Gliquen","volume":"15","author":"Olaru","year":"1969","journal-title":"Wiss. Z. Tech. Hochsch. Ilmenau"},{"issue":"1","key":"10.1016\/0012-365X(92)90134-2_BIB14","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1016\/0095-8956(90)90094-G","article-title":"Locally perfect graphs","volume":"50","author":"Preissmann","year":"1990","journal-title":"J. Combin. Theory Ser. B"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X92901342?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X92901342?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T05:27:50Z","timestamp":1555133270000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X92901342"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,8]]},"references-count":14,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1992,8]]}},"alternative-id":["0012365X92901342"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(92)90134-2","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1992,8]]}}}