Clique graphs and Helly graphs
From MaRDI portal
Publication:802632
DOI10.1016/0095-8956(91)90004-4zbMATH Open0726.05060OpenAlexW2033801242MaRDI QIDQ802632FDOQ802632
Authors: 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
Recommendations
Extremal problems in graph theory (05C35) Structural characterization of families of graphs (05C75) Graph theory (05C99)
Cites Work
- Tensor Geometry
- Intersection graphs of paths in a tree
- On bridged graphs and cop-win graphs
- Vertex-to-vertex pursuit in a graph
- Über iterierte Clique-Graphen
- Convexity in Graphs and Hypergraphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- The intersection graphs of subtrees in trees are exactly the chordal graphs
- Characterizations of strongly chordal graphs
- Distance-hereditary graphs
- Characterizations of totally balanced matrices
- A characterization of ptolemaic graphs
- Title not available (Why is that?)
- On metric properties of certain clique graphs
- A partial characterization of clique graphs
- Clique graphs of time graphs
- A characterization of clique graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Dismantling absolute retracts of reflexive graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- On hypergraph acyclicity and graph chordality
- Title not available (Why is that?)
- Title not available (Why is that?)
- The smallest graph variety containing all paths
- On the Helly property working as a compactness criterion on graphs
- On clique-critical graphs
- Title not available (Why is that?)
- Diameters of iterated clique graphs of chordal graphs
- On iterated clique graphs with increasing diameters
- Title not available (Why is that?)
- On Graphs Without Multicliqual Edges
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (65)
- Guarding isometric subgraphs and cops and robber in planar graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the homotopy type of the iterated clique graphs of low degree
- The complexity of growing a graph
- First-order logic axiomatization of metric graph theory
- Helly groups
- Fast deterministic algorithms for computing all eccentricities in (hyperbolic) Helly graphs
- Distance problems within Helly graphs and \(k\)-Helly graphs
- The complexity of growing a graph
- On the iterated biclique operator
- Clique-gated graphs
- On clique convergent graphs
- The clique operator on graphs with few \(P_{4}\)'s
- Recognizing clique graphs of directed edge path graphs
- On the iterated edge-biclique operator
- Injective hulls of various graph classes
- Faster recognition of clique-Helly and hereditary clique-Helly graphs
- The Helly property and satisfiability of Boolean formulas defined on set families
- Absolute retracts and varieties generated by chordal graphs
- Biclique-Helly graphs
- Discrete Morse theory and the homotopy type of clique graphs
- Posets, clique graphs and their homotopy type
- A story of diameter, radius, and (almost) Helly property
- On clique-complete graphs
- Simplicial powers of graphs
- The clique operator on cographs and serial graphs
- Title not available (Why is that?)
- Cube intersection concepts in median graphs
- On basic chordal graphs and some of its subclasses
- On expansive graphs
- Title not available (Why is that?)
- Infinite \(\Phi\)-periodic graphs
- Arboricity, \(h\)-index, and dynamic algorithms
- Equivariant collapses and the homotopy type of iterated clique graphs
- Two infinite families of critical clique-Helly graphs
- Dually chordal graphs
- Recognizing clique graphs of directed and rooted path graphs
- Iterated Clique Graphs and Contractibility
- Self-clique Helly circular-arc graphs
- Weakly Modular Graphs and Nonpositive Curvature
- Helly-gap of a graph and vertex eccentricities
- On neighborhood-Helly graphs
- Beyond Helly graphs: the diameter problem on absolute retracts
- Simplicial Powers of Graphs
- Almost every graph is divergent under the biclique operator
- Mini-workshop: Nonpositively curved complexes. Abstracts from the mini-workshop held February 7--13, 2021 (online meeting)
- Cliques, minors and apex graphs
- Absolute reflexive retracts and absolute bipartite retracts
- Clique divergent graphs with unbounded sequence of diameters
- Powers of distance-hereditary graphs
- On clique convergence of graphs
- The parallel solution of domination problems on chordal and strongly chordal graphs
- The clique complex and hypergraph matching
- On the edge‐biclique graph and the iterated edge‐biclique operator
- On the existence of critical clique-Helly graphs
- The efficiency of AC graphs
- Contractibility and the clique graph operator
- Convergence of iterated clique graphs
- Partial characterizations of clique-perfect graphs II: Diamond-free and Helly circular-arc graphs
- Netlike partial cubes, IV: Fixed finite subgraph theorems
- Absolute retracts of split graphs
- A polynomial algorithm for the strong Helly property
- Intersection graphs of maximal hypercubes
- A survey on hypergraph products
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)
