{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T06:25:32Z","timestamp":1649139932955},"reference-count":5,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[2004,5,1]],"date-time":"2004-05-01T00:00:00Z","timestamp":1083369600000},"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":3364,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2004,5]]},"DOI":"10.1016\/s0166-218x(03)00369-x","type":"journal-article","created":{"date-parts":[[2003,7,31]],"date-time":"2003-07-31T22:28:16Z","timestamp":1059690496000},"page":"3-17","source":"Crossref","is-referenced-by-count":7,"title":["Cliques and extended triangles. A necessary condition for planar clique graphs"],"prefix":"10.1016","volume":"141","author":[{"given":"Liliana","family":"Alc\u00f3n","sequence":"first","affiliation":[]},{"given":"Marisa","family":"Gutierrez","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(03)00369-X_BIB1","unstructured":"T. Nishizeki, N. Chiba, Planar Graphs: Theory and Algorithms, Annals of Discrete Mathematics, Vol. 32, North-Holland, Amsterdam, New York, Oxford, Tokyo, (1988)."},{"issue":"3","key":"10.1016\/S0166-218X(03)00369-X_BIB2","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1002\/jgt.3190180308","article-title":"A common generalization of line graphs and clique graphs","volume":"18","author":"Prisner","year":"1994","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0166-218X(03)00369-X_BIB3","doi-asserted-by":"crossref","first-page":"102","DOI":"10.1016\/0095-8956(71)90070-0","article-title":"A characterizations of clique graphs","volume":"10","author":"Roberts","year":"1971","journal-title":"J. Combin. Theory B"},{"key":"10.1016\/S0166-218X(03)00369-X_BIB4","first-page":"29","article-title":"Recognizing clique Helly graphs","volume":"45","author":"Szwarcfiter","year":"1997","journal-title":"Ars Combin."},{"key":"10.1016\/S0166-218X(03)00369-X_BIB5","doi-asserted-by":"crossref","unstructured":"J.L. Szwarcfiter, A survey on clique graphs, in: C. Linhares, B. Reed (Eds.), Recent Advances in Algorithms and Combinatorics, Springer, Berlin, to appear.","DOI":"10.1007\/0-387-22444-0_5"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X0300369X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X0300369X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,17]],"date-time":"2019-03-17T07:58:42Z","timestamp":1552809522000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X0300369X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,5]]},"references-count":5,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2004,5]]}},"alternative-id":["S0166218X0300369X"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(03)00369-x","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2004,5]]}}}