{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T15:43:51Z","timestamp":1725637431049},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642258695"},{"type":"electronic","value":"9783642258701"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-25870-1_3","type":"book-chapter","created":{"date-parts":[[2011,11,30]],"date-time":"2011-11-30T13:32:45Z","timestamp":1322659965000},"page":"11-22","source":"Crossref","is-referenced-by-count":0,"title":["Split Clique Graph Complexity"],"prefix":"10.1007","author":[{"given":"Liliana","family":"Alc\u00f3n","sequence":"first","affiliation":[]},{"given":"Luerbio","family":"Faria","sequence":"additional","affiliation":[]},{"given":"Celina M. H.","family":"de Figueiredo","sequence":"additional","affiliation":[]},{"given":"Marisa","family":"Gutierrez","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"3_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/11917496_24","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"L. Alc\u00f3n","year":"2006","unstructured":"Alc\u00f3n, L., Faria, L., de Figueiredo, C.M.H., Gutierrez, M.: Clique Graph Recognition is NP-Complete. In: Fomin, F.V. (ed.) WG 2006. LNCS, vol.\u00a04271, pp. 269\u2013277. Springer, Heidelberg (2006)"},{"key":"3_CR2","doi-asserted-by":"publisher","first-page":"2072","DOI":"10.1016\/j.tcs.2009.01.018","volume":"410","author":"L. Alc\u00f3n","year":"2009","unstructured":"Alc\u00f3n, L., Faria, L., de Figueiredo, C.M.H., Gutierrez, M.: The complexity of clique graph recognition. Theoretical Computer Science\u00a0410, 2072\u20132083 (2009)","journal-title":"Theoretical Computer Science"},{"key":"3_CR3","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0166-218X(03)00369-X","volume":"141","author":"L. Alc\u00f3n","year":"2004","unstructured":"Alc\u00f3n, L., Gutierrez, M.: Cliques and extended triangles. A necessary condition for planar clique graphs. Discrete Appl. Math.\u00a0141, 3\u201317 (2004)","journal-title":"Discrete Appl. Math."},{"key":"3_CR4","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1137\/S0895480193253415","volume":"11","author":"A. Brandst\u00e4dt","year":"1998","unstructured":"Brandst\u00e4dt, A., Dragan, F.F., Chepoi, V.D., Voloshin, V.: Dually chordal graphs. SIAM J. Discrete Math.\u00a011, 437\u2013455 (1998)","journal-title":"SIAM J. Discrete Math."},{"key":"3_CR5","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)","DOI":"10.1137\/1.9780898719796"},{"key":"3_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1002\/jcd.20179","volume":"17","author":"M.C. Dourado","year":"2009","unstructured":"Dourado, M.C., Protti, F., Szwarcfiter, J.L.: Complexity Aspects of the Helly Property: Graphs and Hypergraphs. Electron. J. Combin.\u00a017, 1\u201353 (2009)","journal-title":"Electron. J. Combin."},{"key":"3_CR7","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. J. Combin. Theory Ser. B\u00a05, 192\u2013197 (1968)","journal-title":"J. Combin. Theory Ser. B"},{"key":"3_CR8","doi-asserted-by":"crossref","unstructured":"McKee, T.A., McMorris, F.R.: Topics in Intersection Graph Theory. SIAM Monographs on Discrete Mathematics and Applications (1999)","DOI":"10.1137\/1.9780898719802"},{"key":"3_CR9","unstructured":"Papadimitriou, C.H.: Computational Complexity. Addison-Wesley (1994)"},{"key":"3_CR10","unstructured":"Prisner, E.: Graph Dynamics. Pitman Research Notes in Mathematics 338, Longman (1995)"},{"key":"3_CR11","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. J. Combin. Theory Ser. B\u00a010, 102\u2013108 (1971)","journal-title":"J. Combin. Theory Ser. B"},{"key":"3_CR12","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1137\/S0895480191223191","volume":"7","author":"J.L. Szwarcfiter","year":"1994","unstructured":"Szwarcfiter, J.L., Bornstein, C.F.: Clique graphs of chordal graphs and path graphs. SIAM J. Discrete Math.\u00a07, 331\u2013336 (1994)","journal-title":"SIAM J. Discrete Math."},{"key":"3_CR13","first-page":"29","volume":"45","author":"J.L. Szwarcfiter","year":"1997","unstructured":"Szwarcfiter, J.L.: Recognizing clique-Helly graphs. Ars Combin.\u00a045, 29\u201332 (1997)","journal-title":"Ars Combin."},{"key":"3_CR14","series-title":"CMS Books Math.\/Ouvrages Math. SMC","first-page":"109","volume-title":"Recent Advances in Algorithms and Combinatorics","author":"J.L. Szwarcfiter","year":"2003","unstructured":"Szwarcfiter, J.L.: A survey on Clique Graphs. In: Linhares-Sales, C., Reed, B. (eds.) Recent Advances in Algorithms and Combinatorics. CMS Books Math.\/Ouvrages Math. SMC, vol.\u00a011, pp. 109\u2013136. Springer, New York (2003)"}],"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\/978-3-642-25870-1_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,20]],"date-time":"2019-04-20T01:18:44Z","timestamp":1555723124000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-25870-1_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642258695","9783642258701"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-25870-1_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}