Complexity aspects of the Helly property: graphs and hypergraphs
From MaRDI portal
Publication:1960293
Recommendations
Cited in
(21)- Split clique graph complexity
- On the clique behavior and Hellyness of the complements of regular graphs
- Fast deterministic algorithms for computing all eccentricities in (hyperbolic) Helly graphs
- The Helly property on subfamilies of limited size
- The Helly property and satisfiability of Boolean formulas defined on set families
- Characterization of classical graph classes by weighted clique graphs
- On the generalized Helly property of hypergraphs, cliques, and bicliques
- A story of diameter, radius, and (almost) Helly property
- On the computational complexity of the Helly number in the \(P_3\) and related convexities
- Domination in digraphs and their direct and Cartesian products
- A unified approach to recognize squares of split graphs
- scientific article; zbMATH DE number 5064049 (Why is no real title available?)
- On neighborhood-Helly graphs
- The colorful Helly property for hypergraphs
- The complexity of Helly-\(B_1\) EPG graph recognition
- scientific article; zbMATH DE number 4101253 (Why is no real title available?)
- The problem of determining the Helly dimension of a graph
- Fast deterministic algorithms for computing all eccentricities in (hyperbolic) Helly graphs
- The colorful Helly theorem and general hypergraphs
- On the Helly property working as a compactness criterion on graphs
- Helly's property for \(n\)-cliques and the degree of a graph
This page was built for publication: Complexity aspects of the Helly property: graphs and hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1960293)