{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T03:30:36Z","timestamp":1777606236315,"version":"3.51.4"},"reference-count":14,"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)90078-e","type":"journal-article","created":{"date-parts":[[2005,2,9]],"date-time":"2005-02-09T09:37:08Z","timestamp":1107941828000},"page":"231-240","source":"Crossref","is-referenced-by-count":33,"title":["A fast algorithm for coloring Meyniel graphs"],"prefix":"10.1016","volume":"50","author":[{"given":"A","family":"Hertz","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0095-8956(90)90078-E_BIB1","first-page":"114","article-title":"F\u00e4rbung von Graphen, deren s\u00e4mtliche beziehungsweise deren ungerade Kreise starr sind","author":"Berge","year":"1961","journal-title":"Wiss. Z. Martin-Luther-Univ. Halle-Wittenberg Math.-Natur. Reihe"},{"key":"10.1016\/0095-8956(90)90078-E_BIB2","series-title":"Graphes","author":"Berge","year":"1983"},{"key":"10.1016\/0095-8956(90)90078-E_BIB3","series-title":"Topics on Perfect Graphs","first-page":"57","article-title":"Strongly perfect graphs","volume":"Vol. 21","author":"Berge","year":"1984"},{"key":"10.1016\/0095-8956(90)90078-E_BIB4","doi-asserted-by":"crossref","unstructured":"M. E. Bertschi, Perfectly contractile graphs, J. Combin. Theory Ser. B, in press.","DOI":"10.1016\/0095-8956(90)90077-D"},{"key":"10.1016\/0095-8956(90)90078-E_BIB5","series-title":"Topics on Perfect Graphs","first-page":"253","article-title":"Parity graphs","volume":"Vol. 21","author":"Burlet","year":"1984"},{"key":"10.1016\/0095-8956(90)90078-E_BIB6","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/BF02579273","article-title":"The ellipsoid method and its consequences in combinatorial optimization","volume":"1","author":"Gr\u00f6tschel","year":"1981","journal-title":"Combinatorica"},{"key":"10.1016\/0095-8956(90)90078-E_BIB7","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)90078-E_BIB8","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)90078-E_BIB9","doi-asserted-by":"crossref","first-page":"339","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\/0095-8956(90)90078-E_BIB10","series-title":"Topics on Perfect Graphs","first-page":"115","article-title":"The graphs whose odd cycles have at least two chords","volume":"Vol. 21","author":"Meyniel","year":"1984"},{"key":"10.1016\/0095-8956(90)90078-E_BIB11","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. Combin."},{"key":"10.1016\/0095-8956(90)90078-E_BIB12","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1007\/BF02591953","article-title":"A note on strong perfectness of graphs","volume":"31","author":"Preissmann","year":"1985","journal-title":"Math. Programming"},{"key":"10.1016\/0095-8956(90)90078-E_BIB13","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 Ser. B"},{"key":"10.1016\/0095-8956(90)90078-E_BIB14","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":"Vol. 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:009589569090078E?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:009589569090078E?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,29]],"date-time":"2019-01-29T10:52:03Z","timestamp":1548759123000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/009589569090078E"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,12]]},"references-count":14,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1990,12]]}},"alternative-id":["009589569090078E"],"URL":"https:\/\/doi.org\/10.1016\/0095-8956(90)90078-e","relation":{},"ISSN":["0095-8956"],"issn-type":[{"value":"0095-8956","type":"print"}],"subject":[],"published":{"date-parts":[[1990,12]]}}}