{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,25]],"date-time":"2025-09-25T18:19:29Z","timestamp":1758824369450},"reference-count":31,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1996,11,1]],"date-time":"1996-11-01T00:00:00Z","timestamp":846806400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/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":6102,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[1996,11]]},"DOI":"10.1016\/0012-365x(95)00156-q","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T17:25:26Z","timestamp":1049736326000},"page":"165-175","source":"Crossref","is-referenced-by-count":14,"title":["Some properties of minimal imperfect graphs"],"prefix":"10.1016","volume":"160","author":[{"given":"Ch\u00ednh T.","family":"Ho\u00e0ng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(95)00156-Q_BIB1","first-page":"123","article-title":"Les probl\u00e8mes de coloration en th\u00e9orie des graphes","volume":"9","author":"Berge","year":"1960","journal-title":"Publ. Inst. Stat. Univ. Paris"},{"key":"10.1016\/0012-365X(95)00156-Q_BIB2","series-title":"Topics on perfect Graphs","year":"1984"},{"key":"10.1016\/0012-365X(95)00156-Q_BIB3","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1016\/0012-365X(79)90065-7","article-title":"Graphical properties related to minimal imperfection","volume":"27","author":"Bland","year":"1979","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(95)00156-Q_BIB4","series-title":"Topics on Perfect Graphs","article-title":"Polynomial algorithm to recognize a Meyniel graph","volume":"21","author":"Burlet","year":"1984"},{"key":"10.1016\/0012-365X(95)00156-Q_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 B"},{"key":"10.1016\/0012-365X(95)00156-Q_BIB6","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/0012-365X(79)90114-6","article-title":"Combinatorial designs related to the perfect graph conjecture","volume":"26","author":"Chv\u00e1tal","year":"1979","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(95)00156-Q_BIB7","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/BF01788536","article-title":"Bull-free perfect graphs","volume":"3","author":"Chv\u00e1tal","year":"1987","journal-title":"Graphs Combin."},{"key":"10.1016\/0012-365X(95)00156-Q_BIB8","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/0012-365X(94)90373-5","article-title":"New classes of perfect graphs","volume":"131","author":"De Simone","year":"1994","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(95)00156-Q_BIB9","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1016\/0095-8956(72)90032-9","article-title":"Anti-blocking polyhedra","volume":"12","author":"Fulkerson","year":"1972","journal-title":"J. Combin. Theory B"},{"key":"10.1016\/0012-365X(95)00156-Q_BIB10","series-title":"Algorithmic Graph Theory and Perfect Graphs","author":"Golumbic","year":"1980"},{"key":"10.1016\/0012-365X(95)00156-Q_BIB11_1","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 Combin."},{"key":"10.1016\/0012-365X(95)00156-Q_BIB11_2","first-page":"33","article-title":"Optimizing weakly triangulated graphs","volume":"6","author":"Hayward","year":"1990","journal-title":"Erratum"},{"key":"10.1016\/0012-365X(95)00156-Q_BIB12","article-title":"Perfect graphs","author":"Ho\u00e0ng","year":"1985"},{"key":"10.1016\/0012-365X(95)00156-Q_BIB13","doi-asserted-by":"crossref","first-page":"302","DOI":"10.1016\/0095-8956(87)90047-5","article-title":"On a conjecture of Meyniel","volume":"42","author":"Ho\u00e0ng","year":"1987","journal-title":"J. Combin. Theory B"},{"key":"10.1016\/0012-365X(95)00156-Q_BIB14","doi-asserted-by":"crossref","first-page":"282","DOI":"10.1016\/0095-8956(90)90031-T","article-title":"On a sibling-structure of perfect graphs","volume":"49","author":"Ho\u00e0ng","year":"1990","journal-title":"J. Combin. Theory B"},{"key":"10.1016\/0012-365X(95)00156-Q_BIB15","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1007\/BF01788660","article-title":"Opposition graphs are strict quasi-parity graphs","volume":"5","author":"Ho\u00e0ng","year":"1989","journal-title":"Graphs Combin."},{"key":"10.1016\/0012-365X(95)00156-Q_BIB16","article-title":"Perfekte graphen. Diplomarbeit","author":"Hougardy","year":"1991"},{"key":"10.1016\/0012-365X(95)00156-Q_BIB17","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\/0012-365X(95)00156-Q_BIB18","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(95)00156-Q_BIB19","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":"Eur. J. Combin."},{"key":"10.1016\/0012-365X(95)00156-Q_BIB20","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":"J. Combin. Theory B"},{"key":"10.1016\/0012-365X(95)00156-Q_BIB21","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1016\/0095-8956(88)90071-8","article-title":"No antitwins in minimal graphs","volume":"45","author":"Olariu","year":"1988","journal-title":"J. Combin. Theory B"},{"key":"10.1016\/0012-365X(95)00156-Q_BIB22","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1002\/jgt.3190120206","article-title":"On the strong perfect graphs conjecture","volume":"12","author":"Olariu","year":"1988","journal-title":"J. Graph. Theory"},{"key":"10.1016\/0012-365X(95)00156-Q_BIB23","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1007\/BF01580235","article-title":"Perfect zero-one matrices","volume":"6","author":"Padberg","year":"1974","journal-title":"Math. Programming"},{"key":"10.1016\/0012-365X(95)00156-Q_BIB24","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 B"},{"key":"10.1016\/0012-365X(95)00156-Q_BIB25","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-e)-free graphs","volume":"26","author":"Parthasarthy","year":"1979","journal-title":"J. Combin. Theory B"},{"key":"10.1016\/0012-365X(95)00156-Q_BIB26","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1016\/0095-8956(82)90068-5","article-title":"Meyniel graphs are strongly perfect","volume":"33","author":"Ravindra","year":"1982","journal-title":"J. Combin. Theory B"},{"key":"10.1016\/0012-365X(95)00156-Q_BIB27","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1016\/0012-365X(87)90063-X","article-title":"A note on even pairs","volume":"65","author":"Reed","year":"1987","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(95)00156-Q_BIB28","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":"J. Combin. Theory B"},{"key":"10.1016\/0012-365X(95)00156-Q_BIB29","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 B"},{"key":"10.1016\/0012-365X(95)00156-Q_BIB30","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1016\/0095-8956(87)90048-7","article-title":"Coloring perfect (K4 - e)-free graphs","volume":"42","author":"Tucker","year":"1987","journal-title":"J. Combin. Theory B"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/api.elsevier.com\/content\/article\/PII:0012365X9500156Q?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/api.elsevier.com\/content\/article\/PII:0012365X9500156Q?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,3,20]],"date-time":"2024-03-20T11:54:40Z","timestamp":1710935680000},"score":1,"resource":{"primary":{"URL":"http:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X9500156Q"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,11]]},"references-count":31,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1996,11]]}},"alternative-id":["0012365X9500156Q"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(95)00156-q","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1996,11]]}}}