{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,20]],"date-time":"2026-04-20T22:54:29Z","timestamp":1776725669142,"version":"3.51.2"},"reference-count":15,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1990,12,1]],"date-time":"1990-12-01T00:00:00Z","timestamp":660009600000},"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":8264,"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":[[1990,12]]},"DOI":"10.1016\/0095-8956(90)90077-d","type":"journal-article","created":{"date-parts":[[2005,2,9]],"date-time":"2005-02-09T14:37:08Z","timestamp":1107959828000},"page":"222-230","source":"Crossref","is-referenced-by-count":29,"title":["Perfectly contractile graphs"],"prefix":"10.1016","volume":"50","author":[{"given":"Marc E","family":"Bertschi","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0095-8956(90)90077-D_BIB1","author":"Berge","year":"1973"},{"key":"10.1016\/0095-8956(90)90077-D_BIB2","article-title":"Topics on Perfect Graphs","volume":"21","author":"Berge","year":"1984","journal-title":"Ann. Discrete Math."},{"key":"10.1016\/0095-8956(90)90077-D_BIB3","doi-asserted-by":"crossref","unstructured":"C. Berge and P. Duchet, Strongly perfect graphs, in [2], 57\u201361.","DOI":"10.1016\/S0304-0208(08)72922-0"},{"key":"10.1016\/0095-8956(90)90077-D_BIB4","doi-asserted-by":"crossref","unstructured":"M. Burlet and J. P. Uhry, Parity graphs, in [2], 253\u2013277.","DOI":"10.1016\/S0304-0208(08)72939-6"},{"key":"10.1016\/0095-8956(90)90077-D_BIB5","doi-asserted-by":"crossref","unstructured":"V. Chv\u00e1tal, Perfectly ordered graphs, in [2], 63\u201365.","DOI":"10.1016\/S0304-0208(08)72923-2"},{"key":"10.1016\/0095-8956(90)90077-D_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(90)90077-D_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\/0095-8956(90)90077-D_BIB8","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(90)90077-D_BIB9","doi-asserted-by":"crossref","first-page":"264","DOI":"10.1016\/S0021-9800(69)80086-4","article-title":"Uniquely colorable graphs","volume":"6","author":"Harary","year":"1969","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/0095-8956(90)90077-D_BIB10","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/0095-8956(90)90078-E","article-title":"A fast algorithm for coloring Meyniel graphs","volume":"50","author":"Hertz","year":"1990","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/0095-8956(90)90077-D_BIB11","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1016\/0012-365X(88)90047-7","article-title":"Perfectly orderable graphs are quasi-parity graphs: A short proof","volume":"68","author":"Hertz","year":"1988","journal-title":"Discrete Math."},{"key":"10.1016\/0095-8956(90)90077-D_BIB12","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 Ser. B"},{"key":"10.1016\/0095-8956(90)90077-D_BIB13","doi-asserted-by":"crossref","unstructured":"H. Meyniel, The graphs whose odd cycles have at least two chords, in [2], 115\u2013119.","DOI":"10.1016\/S0304-0208(08)72927-X"},{"key":"10.1016\/0095-8956(90)90077-D_BIB14","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 J. Combinat."},{"key":"10.1016\/0095-8956(90)90077-D_BIB15","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1007\/BF01818537","article-title":"Posets having a unique decomposition into the minimum number of antichains","volume":"17","author":"Rabinovitch","year":"1978","journal-title":"Aequationes Math."}],"container-title":["Journal of Combinatorial Theory, Series B"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:009589569090077D?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:009589569090077D?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,4,5]],"date-time":"2020-04-05T18:09:27Z","timestamp":1586110167000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/009589569090077D"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,12]]},"references-count":15,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1990,12]]}},"alternative-id":["009589569090077D"],"URL":"https:\/\/doi.org\/10.1016\/0095-8956(90)90077-d","relation":{},"ISSN":["0095-8956"],"issn-type":[{"value":"0095-8956","type":"print"}],"subject":[],"published":{"date-parts":[[1990,12]]}}}