{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,10]],"date-time":"2024-07-10T19:48:30Z","timestamp":1720640910623},"reference-count":12,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2009,12,1]],"date-time":"2009-12-01T00:00:00Z","timestamp":1259625600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electronic Notes in Discrete Mathematics"],"published-print":{"date-parts":[[2009,12]]},"DOI":"10.1016\/j.endm.2009.11.040","type":"journal-article","created":{"date-parts":[[2009,12,4]],"date-time":"2009-12-04T05:03:36Z","timestamp":1259903016000},"page":"241-246","source":"Crossref","is-referenced-by-count":4,"special_numbering":"C","title":["The number of convergent graphs under the biclique operator with no twin vertices is finite"],"prefix":"10.1016","volume":"35","author":[{"given":"Marina E.","family":"Groshaus","sequence":"first","affiliation":[]},{"given":"Leandro P.","family":"Montero","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.endm.2009.11.040_bib001","series-title":"Graph-theoretic concepts in computer science","first-page":"269","article-title":"Clique graph recognition is NP-complete","volume":"vol. 4271","author":"Alc\u00f3n","year":"2006"},{"key":"10.1016\/j.endm.2009.11.040_bib002","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1016\/j.disc.2003.12.011","article-title":"Dismantlings and iterated clique graphs","volume":"282","author":"Fr\u00edas-Armenta","year":"2004","journal-title":"Discrete Math."},{"key":"10.1016\/j.endm.2009.11.040_bib003","unstructured":"Groshaus, M. E. and L. P. Montero, On the iterated biclique operator, in: Proceedings of the VI ALIO\/EURO Workshop on Applied Combinatorial Optimization, 2008, pp. CD\u2013ROM Version"},{"key":"10.1016\/j.endm.2009.11.040_bib004","doi-asserted-by":"crossref","unstructured":"Groshaus, M. E. and J. L. Szwarcfiter, Biclique graphs (2008), manuscript","DOI":"10.1007\/s00373-007-0756-6"},{"key":"10.1016\/j.endm.2009.11.040_bib005","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. Combinatorial Theory"},{"key":"10.1016\/j.endm.2009.11.040_bib006","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/j.disc.2003.10.023","article-title":"The clique operator on cographs and serial graphs","volume":"282","author":"Larri\u00f3n","year":"2004","journal-title":"Discrete Math."},{"key":"10.1016\/j.endm.2009.11.040_bib007","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1016\/S0012-365X(02)00266-2","article-title":"Whitney triangulations, local girth and iterated clique graphs","volume":"258","author":"Larri\u00f3n","year":"2002","journal-title":"Discrete Math."},{"key":"10.1016\/j.endm.2009.11.040_bib008","doi-asserted-by":"crossref","first-page":"3199","DOI":"10.1016\/j.disc.2007.06.021","article-title":"Equivariant collapses and the homotopy type of iterated clique graphs","volume":"308","author":"Larri\u00f3n","year":"2008","journal-title":"Discrete Math."},{"key":"10.1016\/j.endm.2009.11.040_bib009","unstructured":"Montero, L. P., \u201cConvergencia y divergencia del grafo biclique iterado,\u201d Master's thesis, Departamento de Computaci\u00f3n. Facultad de Ciencias Exactas y Naturales. Universidad de Buenos Aires. (2008)"},{"key":"10.1016\/j.endm.2009.11.040_bib010","article-title":"Clique divergence in graphs","volume":"Vol. I, II","author":"Neumann Lara","year":"1978"},{"key":"10.1016\/j.endm.2009.11.040_bib011","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1016\/S0012-365X(02)00502-2","article-title":"The icosahedron is clique divergent","volume":"262","author":"Piza\u00f1a","year":"2003","journal-title":"Discrete Math."},{"key":"10.1016\/j.endm.2009.11.040_bib012","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. Combinatorial Theory Ser. B"}],"container-title":["Electronic Notes in Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571065309001930?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571065309001930?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,5,24]],"date-time":"2019-05-24T03:35:01Z","timestamp":1558668901000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571065309001930"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,12]]},"references-count":12,"alternative-id":["S1571065309001930"],"URL":"https:\/\/doi.org\/10.1016\/j.endm.2009.11.040","relation":{},"ISSN":["1571-0653"],"issn-type":[{"value":"1571-0653","type":"print"}],"subject":[],"published":{"date-parts":[[2009,12]]}}}