{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,10]],"date-time":"2026-04-10T16:40:05Z","timestamp":1775839205318,"version":"3.50.1"},"reference-count":43,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1991,1,1]],"date-time":"1991-01-01T00:00:00Z","timestamp":662688000000},"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":8233,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Combinatorial Theory, Series B"],"published-print":{"date-parts":[[1991,1]]},"DOI":"10.1016\/0095-8956(91)90004-4","type":"journal-article","created":{"date-parts":[[2004,12,22]],"date-time":"2004-12-22T01:35:48Z","timestamp":1103679348000},"page":"34-45","source":"Crossref","is-referenced-by-count":66,"title":["Clique graphs and Helly graphs"],"prefix":"10.1016","volume":"51","author":[{"given":"Hans-J\u00fcrgen","family":"Bandelt","sequence":"first","affiliation":[]},{"given":"Erich","family":"Prisner","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0095-8956(91)90004-4_BIB1","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1016\/0196-6774(84)90028-2","article-title":"Characterizations of totally balanced matrices","volume":"5","author":"Anstee","year":"1984","journal-title":"J. Algorithms"},{"key":"10.1016\/0095-8956(91)90004-4_BIB2","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1016\/0095-8956(88)90093-7","article-title":"On bridged graphs and cop-win graphs","volume":"44","author":"Anstee","year":"1988","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/0095-8956(91)90004-4_BIB3","first-page":"263","article-title":"Self-clique graphs and diameters of iterated clique graphs","volume":"29","author":"Balakrishnan","year":"1986","journal-title":"Utilitas Math."},{"key":"10.1016\/0095-8956(91)90004-4_BIB4","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1016\/0095-8956(86)90043-2","article-title":"Distance-hereditary graphs","volume":"41","author":"Bandelt","year":"1986","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/0095-8956(91)90004-4_BIB5","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1016\/S0195-6698(89)80053-8","article-title":"Dismantling absolute retracts of reflexive graphs","volume":"10","author":"Bandelt","year":"1989","journal-title":"European J. Combin."},{"key":"10.1016\/0095-8956(91)90004-4_BIB6","author":"Berge","year":"1973"},{"key":"10.1016\/0095-8956(91)90004-4_BIB7","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1002\/jgt.3190050416","article-title":"On graphs without multicliqual edges","volume":"5","author":"Chong-Keang","year":"1981","journal-title":"J. Graph Theory"},{"key":"10.1016\/0095-8956(91)90004-4_BIB8","first-page":"43","article-title":"Recognition algorithms and design methodology for acyclic database schemes","volume":"Vol. 3","author":"D'Atri","year":"1986"},{"key":"10.1016\/0095-8956(91)90004-4_BIB9","article-title":"On hypergraph acyclicity and graph chordality","author":"D'Atri","year":"1986","journal-title":"Report IASI-CNR R. 170"},{"key":"10.1016\/0095-8956(91)90004-4_BIB10","first-page":"117","article-title":"Propri\u00e9t\u00e9 de Helly et probl\u00e8mes de repr\u00e9sentation","volume":"Vol. 260","author":"Duchet","year":"1978"},{"key":"10.1016\/0095-8956(91)90004-4_BIB11","first-page":"67","article-title":"Classical perfect graphs: An introduction with emphasis on triangulated and interval graphs","volume":"21","author":"Duchet","year":"1984","journal-title":"Ann. Discrete Math."},{"key":"10.1016\/0095-8956(91)90004-4_BIB12","first-page":"399","article-title":"Types of cycles in hypergraphs","volume":"27","author":"Duke","year":"1985","journal-title":"Ann. Discrete Math."},{"key":"10.1016\/0095-8956(91)90004-4_BIB13","doi-asserted-by":"crossref","first-page":"59","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\/0095-8956(91)90004-4_BIB14","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"},{"key":"10.1016\/0095-8956(91)90004-4_BIB15","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/0012-365X(83)90154-1","article-title":"Characterizations of strongly chordal graphs","volume":"43","author":"Farber","year":"1983","journal-title":"Discrete Math."},{"key":"10.1016\/0095-8956(91)90004-4_BIB16","doi-asserted-by":"crossref","first-page":"433","DOI":"10.1137\/0607049","article-title":"Convexity in graphs and hypergraphs","volume":"7","author":"Farber","year":"1986","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"10.1016\/0095-8956(91)90004-4_BIB17","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/0095-8956(74)90094-X","article-title":"The intersection graphs of subtrees in trees are exactly the chordal graphs","volume":"16","author":"Gavril","year":"1974","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/0095-8956(91)90004-4_BIB18","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. Combin. Theory"},{"key":"10.1016\/0095-8956(91)90004-4_BIB19","first-page":"139","article-title":"Line graphs of triangleless graphs and iterated clique graphs","volume":"Vol. 303","author":"Hedetniemi","year":"1972"},{"key":"10.1016\/0095-8956(91)90004-4_BIB20","doi-asserted-by":"crossref","first-page":"270","DOI":"10.1016\/0095-8956(84)90059-5","article-title":"Clique graphs of time graphs","volume":"27","author":"Hedman","year":"1984","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/0095-8956(91)90004-4_BIB21","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/0095-8956(79)90069-8","article-title":"On metric properties of certain clique graphs","volume":"27","author":"Howorka","year":"1979","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/0095-8956(91)90004-4_BIB22","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1002\/jgt.3190050314","article-title":"A characterization of ptolemaic graphs","volume":"5","author":"Howorka","year":"1981","journal-title":"J. Graph Theory"},{"key":"10.1016\/0095-8956(91)90004-4_BIB23","series-title":"Combinatorics and Ordered Sets","first-page":"175","article-title":"Retracts: graphs and ordered sets from the metric point of view","volume":"Vol. 57","author":"Jawhari","year":"1986"},{"key":"10.1016\/0095-8956(91)90004-4_BIB24","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\/0095-8956(91)90004-4_BIB25","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1016\/0095-8956(86)90042-0","article-title":"Intersection graphs of paths in a tree","volume":"41","author":"Monma","year":"1986","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/0095-8956(91)90004-4_BIB26","first-page":"313","article-title":"On clique-divergent graphs","volume":"Vol. 260","author":"Neumann-Lara","year":"1978"},{"key":"10.1016\/0095-8956(91)90004-4_BIB27","series-title":"Algebraic Methods in Graph Theory","first-page":"563","article-title":"Clique divergence in graphs","volume":"Vol. 25","author":"Neumann-Lara","year":"1981"},{"key":"10.1016\/0095-8956(91)90004-4_BIB28","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/0012-365X(83)90159-0","article-title":"The smallest graph variety containing all paths","volume":"43","author":"Nowakowski","year":"1983","journal-title":"Discrete Math."},{"key":"10.1016\/0095-8956(91)90004-4_BIB29","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1016\/0012-365X(83)90160-7","article-title":"Vertex-to-vertex pursuit in a graph","volume":"43","author":"Nowakowski","year":"1983","journal-title":"Discrete Math."},{"key":"10.1016\/0095-8956(91)90004-4_BIB30","author":"Pesch","year":"1988"},{"key":"10.1016\/0095-8956(91)90004-4_BIB31","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\/0095-8956(91)90004-4_BIB32","article-title":"Fuzzy Geometry","author":"Poston","year":"1971"},{"key":"10.1016\/0095-8956(91)90004-4_BIB33","article-title":"Homomorphismes, points fixes, r\u00e9tractions et jeux de poursuite dans les graphes, les ensembles ordonn\u00e9s et les espaces m\u00e9triques","author":"Quilliot","year":"1983","journal-title":"Th\u00e8se de Doctorat d'Etat"},{"key":"10.1016\/0095-8956(91)90004-4_BIB34","doi-asserted-by":"crossref","first-page":"186","DOI":"10.1016\/0097-3165(85)90061-5","article-title":"On the Helly property working as a compactness criterion on graphs","volume":"40","author":"Quilliot","year":"1985","journal-title":"J. Combin. Theory Ser. A"},{"key":"10.1016\/0095-8956(91)90004-4_BIB35","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. Combin. Theory Ser. B"},{"key":"10.1016\/0095-8956(91)90004-4_BIB36","first-page":"419","article-title":"d-Convexity in graphs","volume":"28","author":"Soltan","year":"1983","journal-title":"Soviet Math. Dokl."},{"issue":"No. 6","key":"10.1016\/0095-8956(91)90004-4_BIB37","first-page":"14","article-title":"Uslovija sochranenija v grafe d-vypuklost'ju diametrov mno\u017eestv","author":"Soltan","year":"1983","journal-title":"Kibernetika"},{"key":"10.1016\/0095-8956(91)90004-4_BIB38","series-title":"Prof. P. L. Bhainagar Commemoration Volume","first-page":"185","article-title":"Some queries on the periodicity and convergence of a graph","author":"Acharya","year":"1980"},{"key":"10.1016\/0095-8956(91)90004-4_BIB39","first-page":"117","article-title":"Singrammi con duale vertici-cricche","volume":"110","author":"Balconi","year":"1976","journal-title":"Rend. Istit. Lomb. A"},{"key":"10.1016\/0095-8956(91)90004-4_BIB40","first-page":"24","article-title":"Quadrati di singrammi e polarit\u00e0","volume":"112","author":"Balconi","year":"1978","journal-title":"Rend. Istit. Lomb. A"},{"key":"10.1016\/0095-8956(91)90004-4_BIB41","article-title":"Grafi di cricche iterati","author":"Carnazolla","year":"1983","journal-title":"Ph.D. Thesis"},{"key":"10.1016\/0095-8956(91)90004-4_BIB42","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\/0095-8956(91)90004-4_BIB43","series-title":"Homology and convergence of iterated clique graphs","author":"Prisner","year":"1988"}],"container-title":["Journal of Combinatorial Theory, Series B"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0095895691900044?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0095895691900044?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,30]],"date-time":"2019-01-30T20:51:12Z","timestamp":1548881472000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0095895691900044"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,1]]},"references-count":43,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1991,1]]}},"alternative-id":["0095895691900044"],"URL":"https:\/\/doi.org\/10.1016\/0095-8956(91)90004-4","relation":{},"ISSN":["0095-8956"],"issn-type":[{"value":"0095-8956","type":"print"}],"subject":[],"published":{"date-parts":[[1991,1]]}}}