{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T00:07:07Z","timestamp":1648771627105},"reference-count":7,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1996,5,1]],"date-time":"1996-05-01T00:00:00Z","timestamp":830908800000},"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":6286,"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,5]]},"DOI":"10.1016\/0012-365x(94)00083-u","type":"journal-article","created":{"date-parts":[[2003,4,30]],"date-time":"2003-04-30T18:23:46Z","timestamp":1051727026000},"page":"71-79","source":"Crossref","is-referenced-by-count":0,"title":["A characterization of graphs G with G \u2248 K2(G)"],"prefix":"10.1016","volume":"151","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(94)00083-U_BIB1","series-title":"Graphs and Digraphs","author":"Chartrand","year":"1986"},{"key":"10.1016\/0012-365X(94)00083-U_BIB2","first-page":"59","article-title":"\u00dcber iterierte clique-graphen","volume":"39","author":"Escalante","year":"1973"},{"key":"10.1016\/0012-365X(94)00083-U_BIB3","doi-asserted-by":"crossref","first-page":"192","DOI":"10.1016\/S0021-9800(68)80055-9","article-title":"A partial characterization of clique graphs","volume":"5","author":"Hamelink","year":"1968","journal-title":"J. Combin. Theory"},{"key":"10.1016\/0012-365X(94)00083-U_BIB4","series-title":"Graph Theory","author":"Harary","year":"1969"},{"key":"10.1016\/0012-365X(94)00083-U_BIB5","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1002\/jgt.3190020410","article-title":"On supercompact graphs","volume":"2","author":"Lim","year":"1978","journal-title":"J. Graph Theory"},{"key":"10.1016\/0012-365X(94)00083-U_BIB6","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(94)00083-U_BIB7","doi-asserted-by":"crossref","first-page":"102","DOI":"10.1016\/0095-8956(71)90070-0","article-title":"A characterization of clique graphs","volume":"10","author":"Roberts","year":"1971","journal-title":"J. Combin. Theory Ser. B"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X9400083U?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X9400083U?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,24]],"date-time":"2019-04-24T14:23:40Z","timestamp":1556115820000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X9400083U"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,5]]},"references-count":7,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1996,5]]}},"alternative-id":["0012365X9400083U"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(94)00083-u","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1996,5]]}}}