{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T05:32:14Z","timestamp":1760160734488},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540483816"},{"type":"electronic","value":"9783540483823"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11917496_24","type":"book-chapter","created":{"date-parts":[[2006,10,18]],"date-time":"2006-10-18T06:16:13Z","timestamp":1161152173000},"page":"269-277","source":"Crossref","is-referenced-by-count":7,"title":["Clique Graph Recognition Is NP-Complete"],"prefix":"10.1007","author":[{"given":"L.","family":"Alc\u00f3n","sequence":"first","affiliation":[]},{"given":"L.","family":"Faria","sequence":"additional","affiliation":[]},{"given":"C. M. H.","family":"de Figueiredo","sequence":"additional","affiliation":[]},{"given":"M.","family":"Gutierrez","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"24_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.21711\/231766362003\/rmc251","volume":"25","author":"L. Alc\u00f3n","year":"2003","unstructured":"Alc\u00f3n, L., Gutierrez, M.: A new characterization of Clique Graphs. Matem\u00e1tica Contempor\u00e2nea\u00a025, 1\u20137 (2003)","journal-title":"Matem\u00e1tica Contempor\u00e2nea"},{"key":"24_CR2","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0166-218X(03)00369-X","volume":"141\/1-3","author":"L. Alc\u00f3n","year":"2004","unstructured":"Alc\u00f3n, L., Gutierrez, M.: Cliques and Extended Triangles. A necessary condition to be Clique Planar Graph. Discrete Applied Mathematics\u00a0141\/1-3, 3\u201317 (2004)","journal-title":"Discrete Applied Mathematics"},{"unstructured":"Berge, C.: Hypergraphes. Gauthier-Villars Paris (1987)","key":"24_CR3"},{"doi-asserted-by":"crossref","unstructured":"Brandst\u00e4dt, A., Le, V.B., Spinrad, J.P.: Graph Classes: A survey. SIAM Monographs on Discrete Mathematics and Applications (1999)","key":"24_CR4","DOI":"10.1137\/1.9780898719796"},{"key":"24_CR5","volume-title":"Computers and Intractability: a guide to the theory of NP-completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: a guide to the theory of NP-completeness. W.H. Freeman, New York (1979)"},{"key":"24_CR6","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1016\/S0021-9800(68)80055-9","volume":"5","author":"R.C. Hamelink","year":"1968","unstructured":"Hamelink, R.C.: A partial characterization of clique graphs. Journal of Combinatorial Theory B\u00a05, 192\u2013197 (1968)","journal-title":"Journal of Combinatorial Theory B"},{"key":"24_CR7","volume-title":"Computational Complexity","author":"C.M. Papadimitriou","year":"1994","unstructured":"Papadimitriou, C.M.: Computational Complexity. Addison-Wesley, Reading (1994)"},{"key":"24_CR8","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1002\/jgt.3190180308","volume":"18","author":"E. Prisner","year":"1994","unstructured":"Prisner, E.: A common generalization of Line Graphs and Clique Graphs. Journal of Graph Theory\u00a018, 301\u2013313 (1994)","journal-title":"Journal of Graph Theory"},{"key":"24_CR9","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1016\/0095-8956(71)90070-0","volume":"10","author":"F.S. Roberts","year":"1971","unstructured":"Roberts, F.S., Spencer, J.H.: A characterization of clique graphs. Journal of Combinatorial Theory B\u00a010, 102\u2013108 (1971)","journal-title":"Journal of Combinatorial Theory B"},{"key":"24_CR10","volume-title":"Recent Advances in Algorithmic Combinatorics","author":"J.L. Szwarcfiter","year":"2002","unstructured":"Szwarcfiter, J.L.: A survey on Clique Graphs. In: Linhares-Sales, C., Reed, B. (eds.) Recent Advances in Algorithmic Combinatorics. Springer, Heidelberg (2002)"}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11917496_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,9]],"date-time":"2023-05-09T11:57:34Z","timestamp":1683633454000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11917496_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540483816","9783540483823"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/11917496_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}