Clique graphs and Helly graphs
From MaRDI portal
Publication:802632
DOI10.1016/0095-8956(91)90004-4zbMath0726.05060OpenAlexW2033801242MaRDI QIDQ802632
Erich Prisner, Hans-Jürgen Bandelt
Publication date: 1991
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0095-8956(91)90004-4
Extremal problems in graph theory (05C35) Structural characterization of families of graphs (05C75) Graph theory (05C99)
Related Items (50)
The parallel solution of domination problems on chordal and strongly chordal graphs ⋮ Mini-workshop: Nonpositively curved complexes. Abstracts from the mini-workshop held February 7--13, 2021 (online meeting) ⋮ On the iterated edge-biclique operator ⋮ Absolute retracts of split graphs ⋮ On basic chordal graphs and some of its subclasses ⋮ Faster recognition of clique-Helly and hereditary clique-Helly graphs ⋮ On clique convergent graphs ⋮ Powers of distance-hereditary graphs ⋮ Injective hulls of various graph classes ⋮ On neighborhood-Helly graphs ⋮ Infinite \(\Phi\)-periodic graphs ⋮ Helly-gap of a graph and vertex eccentricities ⋮ On clique-complete graphs ⋮ Beyond Helly graphs: the diameter problem on absolute retracts ⋮ On the edge‐biclique graph and the iterated edge‐biclique operator ⋮ Iterated Clique Graphs and Contractibility ⋮ A story of diameter, radius, and (almost) Helly property ⋮ The complexity of growing a graph ⋮ Distance problems within Helly graphs and \(k\)-Helly graphs ⋮ Dually chordal graphs ⋮ Arboricity, \(h\)-index, and dynamic algorithms ⋮ First-order logic axiomatization of metric graph theory ⋮ A survey on hypergraph products ⋮ Almost every graph is divergent under the biclique operator ⋮ Discrete Morse theory and the homotopy type of clique graphs ⋮ Equivariant collapses and the homotopy type of iterated clique graphs ⋮ Contractibility and the clique graph operator ⋮ Posets, clique graphs and their homotopy type ⋮ Convergence of iterated clique graphs ⋮ Absolute reflexive retracts and absolute bipartite retracts ⋮ The efficiency of AC graphs ⋮ Biclique-Helly graphs ⋮ On the Iterated Biclique Operator ⋮ The Helly property and satisfiability of Boolean formulas defined on set families ⋮ Absolute retracts and varieties generated by chordal graphs ⋮ Self-clique Helly circular-arc graphs ⋮ The clique operator on graphs with few \(P_{4}\)'s ⋮ On expansive graphs ⋮ Weakly Modular Graphs and Nonpositive Curvature ⋮ 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 ⋮ The clique operator on cographs and serial graphs ⋮ Simplicial powers of graphs ⋮ Clique divergent graphs with unbounded sequence of diameters ⋮ Recognizing clique graphs of directed and rooted path graphs ⋮ Simplicial Powers of Graphs ⋮ A polynomial algorithm for the strong Helly property ⋮ Recognizing clique graphs of directed edge path graphs ⋮ Intersection graphs of maximal hypercubes
Cites Work
- Clique graphs of time graphs
- Characterizations of strongly chordal graphs
- On the Helly property working as a compactness criterion on graphs
- Intersection graphs of paths in a tree
- Distance-hereditary graphs
- On bridged graphs and cop-win graphs
- On hypergraph acyclicity and graph chordality
- Dismantling absolute retracts of reflexive graphs
- On metric properties of certain clique graphs
- Vertex-to-vertex pursuit in a graph
- The smallest graph variety containing all paths
- On clique-critical graphs
- A characterization of clique graphs
- The intersection graphs of subtrees in trees are exactly the chordal graphs
- Über iterierte Clique-Graphen
- Characterizations of totally balanced matrices
- Diameters of iterated clique graphs of chordal graphs
- Convexity in Graphs and Hypergraphs
- On iterated clique graphs with increasing diameters
- A characterization of ptolemaic graphs
- On Graphs Without Multicliqual Edges
- Tensor Geometry
- A partial characterization of clique graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Clique graphs and Helly graphs