{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T18:37:33Z","timestamp":1649183853985},"reference-count":4,"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":"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":6102,"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":[[1996,11]]},"DOI":"10.1016\/0012-365x(96)00031-3","type":"journal-article","created":{"date-parts":[[2003,4,23]],"date-time":"2003-04-23T20:16:34Z","timestamp":1051128994000},"page":"237-240","source":"Crossref","is-referenced-by-count":3,"title":["On weakly diamond-free Berge graphs"],"prefix":"10.1016","volume":"159","author":[{"given":"Hac\u00e8ne","family":"Ait Haddadene","sequence":"first","affiliation":[]},{"given":"Sylvain","family":"Gravier","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(96)00031-3_BIB1","unstructured":"H. Ait Haddadene and F. Maffray, Coloring perfect degenerate graphs, Discrete Math., to appear."},{"key":"10.1016\/0012-365X(96)00031-3_BIB2","first-page":"131","article-title":"Les probl\u00e8mes de coloration en th\u00e9orie des graphes","volume":"9","author":"Berge","year":"1960","journal-title":"Publ. Inst. Statist. Univ. Paris"},{"key":"10.1016\/0012-365X(96)00031-3_BIB3","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1016\/0095-8956(87)90048-7","article-title":"Coloring perfect (K4 \u2212 e)-free graphs","volume":"42","author":"Tucker","year":"1987","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/0012-365X(96)00031-3_BIB4","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1016\/0095-8956(87)90019-0","article-title":"A reduction procedure for coloring perfect K4-free graphs","volume":"43","author":"Tucker","year":"1987","journal-title":"J. Combin. Theory Ser. B"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X96000313?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X96000313?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,23]],"date-time":"2019-04-23T01:25:44Z","timestamp":1555982744000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X96000313"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,11]]},"references-count":4,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1996,11]]}},"alternative-id":["0012365X96000313"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(96)00031-3","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1996,11]]}}}