{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T03:44:51Z","timestamp":1648698291594},"reference-count":6,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1994,3,1]],"date-time":"1994-03-01T00:00:00Z","timestamp":762480000000},"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":7078,"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":[[1994,3]]},"DOI":"10.1016\/0012-365x(92)00472-4","type":"journal-article","created":{"date-parts":[[2002,7,28]],"date-time":"2002-07-28T20:40:59Z","timestamp":1027888859000},"page":"131-137","source":"Crossref","is-referenced-by-count":2,"title":["A class of clique-closed graphs"],"prefix":"10.1016","volume":"127","author":[{"given":"Chai-Ling","family":"Deng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chong-Keang","family":"Lim","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(92)00472-4_BIB1","unstructured":"B.L. Chen and K.W. Lih, Strongly chordal graphs are clique-closed, preprint."},{"key":"10.1016\/0012-365X(92)00472-4_BIB2","first-page":"59","volume":"39","author":"Escalante","year":"1973"},{"key":"10.1016\/0012-365X(92)00472-4_BIB3","series-title":"Graph Theory","author":"Harary","year":"1969"},{"key":"10.1016\/0012-365X(92)00472-4_BIB4","doi-asserted-by":"crossref","first-page":"270","DOI":"10.1016\/0095-8956(84)90059-5","article-title":"Clique graphs of time graphs","volume":"37","author":"Hedman","year":"1984","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/0012-365X(92)00472-4_BIB5","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1017\/S1446788700024848","article-title":"A result on iterated clique graphs","volume":"32","author":"Lim","year":"1982","journal-title":"J. Austral. Math. Soc. Ser. A"},{"key":"10.1016\/0012-365X(92)00472-4_BIB6","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1002\/jgt.3190050416","article-title":"On graphs without multicliqual edges","volume":"5","author":"Lim","year":"1981","journal-title":"J. Graph Theory"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X92004724?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X92004724?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,11]],"date-time":"2019-04-11T07:23:33Z","timestamp":1554967413000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X92004724"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,3]]},"references-count":6,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1994,3]]}},"alternative-id":["0012365X92004724"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(92)00472-4","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1994,3]]}}}