The clique graph K(G) of a graph G is the intersection graph of the cliques of G. Clique graphs have been characterized by \textit{F. S. Roberts} and \textit{J. Spencer} [J. Comb. Theory, Ser. B 10, 102-108 (1971; Zbl 0245.05128)]. This characterization was motivated by the sufficient condition of \textit{R. C. Hamelink} [J. Comb. Theory 5, 192-197 (1968; Zbl 0167.222)]: the set of cliques of G enjoys the Helly property - that is, every set of pairwise intersecting cliques has a nonempty intersection. Such a graph is called a clique-Helly graph. \textit{F. Escalante} [Abh. Math. Semin. Univ. Hamb. 39, 59-68 (1973; Zbl 0266.05116)] has shown that the class of clique-Helly graphs is closed under the clique graph operator K, i.e., the clique graph of a clique-Helly graph is again a clique-Helly graph and every clique-Helly graph is the clique graph of some clique-Helly graph. \textit{Lim Chong-Keang} and \textit{Peng Yee-Hock} [J. Graph Theory 5, 443-451 (1981; Zbl 0492.05056)] showed that the class of graphs without multicliqual edges is a proper subclass fixed under K and \textit{B. Hedman} [J. Comb. Theory, Ser. B 37, 270-278 (1984; Zbl 0537.05057)] showed that the class of indifference graphs converge, under repeated application of the operator K, to the one-vertex graph. The authors characterize those graphs that converge, under repeated application of K, to the one-vertex graph and exhibit a number of classes of graphs fixed under K.
- A characterization of clique graphs
- A characterization of ptolemaic graphs
- A partial characterization of clique graphs
- Characterizations of strongly chordal graphs
- Characterizations of totally balanced matrices
- Clique graphs of time graphs
- Convexity in Graphs and Hypergraphs
- Diameters of iterated clique graphs of chordal graphs
- Dismantling absolute retracts of reflexive graphs
- Distance-hereditary graphs
- scientific article; zbMATH DE number 3829965 (Why is no real title available?)
- scientific article; zbMATH DE number 3889566 (Why is no real title available?)
- scientific article; zbMATH DE number 3880762 (Why is no real title available?)
- scientific article; zbMATH DE number 3929049 (Why is no real title available?)
- scientific article; zbMATH DE number 3962727 (Why is no real title available?)
- scientific article; zbMATH DE number 3654180 (Why is no real title available?)
- scientific article; zbMATH DE number 3758364 (Why is no real title available?)
- scientific article; zbMATH DE number 3773651 (Why is no real title available?)
- scientific article; zbMATH DE number 3592047 (Why is no real title available?)
- scientific article; zbMATH DE number 3641484 (Why is no real title available?)
- scientific article; zbMATH DE number 3641500 (Why is no real title available?)
- scientific article; zbMATH DE number 3993639 (Why is no real title available?)
- scientific article; zbMATH DE number 3402664 (Why is no real title available?)
- Intersection graphs of paths in a tree
- On bridged graphs and cop-win graphs
- On clique-critical graphs
- On Graphs Without Multicliqual Edges
- On hypergraph acyclicity and graph chordality
- On iterated clique graphs with increasing diameters
- On metric properties of certain clique graphs
- On the Helly property working as a compactness criterion on graphs
- Tensor Geometry
- The intersection graphs of subtrees in trees are exactly the chordal graphs
- The smallest graph variety containing all paths
- Vertex-to-vertex pursuit in a graph
- Über iterierte Clique-Graphen
- On expansive graphs
- Netlike partial cubes, IV: Fixed finite subgraph theorems
- Partial characterizations of clique-perfect graphs II: Diamond-free and Helly circular-arc graphs
- Cube intersection concepts in median graphs
- Simplicial powers of graphs
- Cliques, minors and apex graphs
- Convergence of iterated clique graphs
- Clique divergent graphs with unbounded sequence of diameters
- Recognizing clique graphs of directed and rooted path graphs
- The parallel solution of domination problems on chordal and strongly chordal graphs
- Absolute retracts of split graphs
- Clique-gated graphs
- On clique-complete graphs
- The clique operator on cographs and serial graphs
- A polynomial algorithm for the strong Helly property
- Recognizing clique graphs of directed edge path graphs
- Intersection graphs of maximal hypercubes
- On clique convergent graphs
- Powers of distance-hereditary graphs
- Infinite \(\Phi\)-periodic graphs
- A survey on hypergraph products
- Mini-workshop: Nonpositively curved complexes. Abstracts from the mini-workshop held February 7--13, 2021 (online meeting)
- On the iterated edge-biclique operator
- Injective hulls of various graph classes
- Two infinite families of critical clique-Helly graphs
- Faster recognition of clique-Helly and hereditary clique-Helly graphs
- On the existence of critical clique-Helly graphs
- Discrete Morse theory and the homotopy type of clique graphs
- Posets, clique graphs and their homotopy type
- Biclique-Helly graphs
- Self-clique Helly circular-arc graphs
- The clique operator on graphs with few \(P_{4}\)'s
- Helly-gap of a graph and vertex eccentricities
- Beyond Helly graphs: the diameter problem on absolute retracts
- Distance problems within Helly graphs and \(k\)-Helly graphs
- On basic chordal graphs and some of its subclasses
- Weakly Modular Graphs and Nonpositive Curvature
- On neighborhood-Helly graphs
- Iterated Clique Graphs and Contractibility
- scientific article; zbMATH DE number 1189244 (Why is no real title available?)
- Arboricity, \(h\)-index, and dynamic algorithms
- scientific article; zbMATH DE number 1944140 (Why is no real title available?)
- scientific article; zbMATH DE number 2096436 (Why is no real title available?)
- scientific article; zbMATH DE number 2096437 (Why is no real title available?)
- On the iterated biclique operator
- On clique convergence of graphs
- Simplicial Powers of Graphs
- On the edge‐biclique graph and the iterated edge‐biclique operator
- A story of diameter, radius, and (almost) Helly property
- The complexity of growing a graph
- Dually chordal graphs
- First-order logic axiomatization of metric graph theory
- On the homotopy type of the iterated clique graphs of low degree
- Guarding isometric subgraphs and cops and robber in planar graphs
- The complexity of growing a graph
- Helly groups
- Fast deterministic algorithms for computing all eccentricities in (hyperbolic) Helly graphs
- Absolute reflexive retracts and absolute bipartite retracts
- The efficiency of AC graphs
- The clique complex and hypergraph matching
- Almost every graph is divergent under the biclique operator
- Equivariant collapses and the homotopy type of iterated clique graphs
- Contractibility and the clique graph operator
- The Helly property and satisfiability of Boolean formulas defined on set families
- Absolute retracts and varieties generated by chordal graphs
This page was built for publication: Clique graphs and Helly graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q802632)
