{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,16]],"date-time":"2024-09-16T20:02:31Z","timestamp":1726516951513},"reference-count":25,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[1999,2,1]],"date-time":"1999-02-01T00:00:00Z","timestamp":917827200000},"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":5280,"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":[[1999,2]]},"DOI":"10.1016\/s0012-365x(99)90105-x","type":"journal-article","created":{"date-parts":[[2003,4,23]],"date-time":"2003-04-23T20:16:34Z","timestamp":1051128994000},"page":"491-501","source":"Crossref","is-referenced-by-count":10,"special_numbering":"C","title":["Clique divergent graphs with unbounded sequence of diameters"],"prefix":"10.1016","volume":"197-198","author":[{"given":"F.","family":"Larri\u00f3n","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"V.","family":"Neumann-Lara","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0012-365X(99)90105-X_BIB1","first-page":"185","article-title":"Some queries on the periodicity and convergence of a graph","author":"Acharya","year":"1980","journal-title":"Natl. Acad. Sci. (India), Ser. A"},{"key":"10.1016\/S0012-365X(99)90105-X_BIB2","first-page":"263","article-title":"Self-clique graphs and diameters for iterated clique graphs","volume":"29","author":"Balakrishnan","year":"1986","journal-title":"Utilitas Math."},{"key":"10.1016\/S0012-365X(99)90105-X_BIB3","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1016\/0095-8956(91)90004-4","article-title":"Clique graphs and Helly graphs","volume":"51","author":"Bandelt","year":"1991","journal-title":"J. Combin. Theory. Ser. B"},{"key":"10.1016\/S0012-365X(99)90105-X_BIB4","article-title":"Grafi di Cricce Iterati","author":"Carnazolla","year":"1983","journal-title":"Ph.D. Thesis"},{"key":"10.1016\/S0012-365X(99)90105-X_BIB5","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1002\/jgt.3190140311","article-title":"Diameters of iterated clique graphs of chordal graphs","volume":"14","author":"Chen","year":"1990","journal-title":"J. Graph Theory."},{"key":"10.1016\/S0012-365X(99)90105-X_BIB6","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1007\/BF02992818","article-title":"\u00dcber iterierte Clique-Graphen","volume":"39","author":"Escalante","year":"1973","journal-title":"Abh. Math. Sem. Univ. Hamburg"},{"key":"10.1016\/S0012-365X(99)90105-X_BIB7","doi-asserted-by":"crossref","first-page":"170","DOI":"10.1016\/0095-8956(74)90084-7","article-title":"On clique-critical graphs","volume":"17","author":"Escalante","year":"1974","journal-title":"J. Combin. Theory. Ser. B"},{"year":"1969","series-title":"Graph Theory","author":"Harary","key":"10.1016\/S0012-365X(99)90105-X_BIB8"},{"key":"10.1016\/S0012-365X(99)90105-X_BIB9","first-page":"139","article-title":"Line graphs of triangleless graphs and iterated clique graphs","volume":"vol. 303","author":"Hedetniemi","year":"1972"},{"key":"10.1016\/S0012-365X(99)90105-X_BIB10","article-title":"Open Questions","volume":"12","author":"Hedman","year":"1983","journal-title":"Graph Theory Newslett."},{"key":"10.1016\/S0012-365X(99)90105-X_BIB11","first-page":"273","article-title":"Diameters of iterated clique graphs","volume":"9","author":"Hedman","year":"1986","journal-title":"Hadronic J."},{"key":"10.1016\/S0012-365X(99)90105-X_BIB12","doi-asserted-by":"crossref","first-page":"270","DOI":"10.1016\/0095-8956(84)90059-5","article-title":"Clique graphs of time graphs","volume":"37","author":"Hedman","year":"1984","journal-title":"J. Combin. Theory. Ser. B"},{"key":"10.1016\/S0012-365X(99)90105-X_BIB13","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\/S0012-365X(99)90105-X_BIB14","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1007\/BF03353003","article-title":"A family of clique divergent graphs with linear growth","volume":"13","author":"Larri\u00f3n","year":"1997","journal-title":"Graphs and Comb."},{"key":"10.1016\/S0012-365X(99)90105-X_BIB15","unstructured":"F. Larri\u00f3n, V. Neumann-Lara, Locally C6 graphs are clique divergent, submitted."},{"key":"10.1016\/S0012-365X(99)90105-X_BIB16","doi-asserted-by":"crossref","first-page":"161","DOI":"10.4064\/cm-3-2-161-162","article-title":"Sur le Coloriage des Graphes","volume":"3","author":"Mycielski","year":"1955","journal-title":"Colloq. Math."},{"key":"10.1016\/S0012-365X(99)90105-X_BIB17","series-title":"Probl\u00e8mes Combinatoires et Th\u00e9orie des Graphes","first-page":"313","article-title":"On clique-divergent graphs","volume":"260","author":"Neumann-Lara","year":"1978"},{"key":"10.1016\/S0012-365X(99)90105-X_BIB18","series-title":"Algebraic methods in graph theory","first-page":"563","article-title":"Clique Divergence in graphs","volume":"25","author":"Neumann-Lara","year":"1981"},{"key":"10.1016\/S0012-365X(99)90105-X_BIB19","first-page":"1","article-title":"Clique divergence in graphs, Some variations","volume":"224","author":"Neumann-Lara","year":"1991","journal-title":"Publ. Prelim. Inst. Mat. U.N.A.M. (M\u00e9xico)"},{"key":"10.1016\/S0012-365X(99)90105-X_BIB20","unstructured":"V. Neumann-Lara, A Theory of Expansive Graphs, in preparation."},{"key":"10.1016\/S0012-365X(99)90105-X_BIB21","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1002\/jgt.3190100204","article-title":"On iterated clique graphs with increasing diameters","volume":"10","author":"Peyrat","year":"1986","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0012-365X(99)90105-X_BIB22","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/0012-365X(92)90270-P","article-title":"Convergence of iterated clique graphs","volume":"103","author":"Prisner","year":"1992","journal-title":"Discrete Math."},{"key":"10.1016\/S0012-365X(99)90105-X_BIB23","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"},{"article-title":"Graph Dynamics","year":"1995","author":"Prisner","key":"10.1016\/S0012-365X(99)90105-X_BIB24"},{"key":"10.1016\/S0012-365X(99)90105-X_BIB25","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1002\/jgt.3190200104","article-title":"Squares, clique graphs, and chordality","volume":"20","author":"Wallis","year":"1995","journal-title":"J. Graph Theory"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X9990105X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X9990105X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,22]],"date-time":"2019-03-22T04:21:58Z","timestamp":1553228518000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X9990105X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,2]]},"references-count":25,"alternative-id":["S0012365X9990105X"],"URL":"https:\/\/doi.org\/10.1016\/s0012-365x(99)90105-x","relation":{},"ISSN":["0012-365X"],"issn-type":[{"type":"print","value":"0012-365X"}],"subject":[],"published":{"date-parts":[[1999,2]]}}}