Complexity aspects of the Helly property: graphs and hypergraphs
From MaRDI portal
Publication:1960293
zbMath1206.05002MaRDI QIDQ1960293
Fábio Protti, Mitre C. Dourado, Jayme Luiz Szwarcfiter
Publication date: 13 October 2010
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/222810
Analysis of algorithms and problem complexity (68Q25) Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Graph algorithms (graph-theoretic aspects) (05C85) Helly-type theorems and geometric transversal theory (52A35)
Related Items (14)
Fast deterministic algorithms for computing all eccentricities in (hyperbolic) Helly graphs ⋮ On the computational complexity of the Helly number in the \(P_3\) and related convexities ⋮ A unified approach to recognize squares of split graphs ⋮ On neighborhood-Helly graphs ⋮ Split clique graph complexity ⋮ Domination in digraphs and their direct and Cartesian products ⋮ A story of diameter, radius, and (almost) Helly property ⋮ The colorful Helly theorem and general hypergraphs ⋮ On the generalized Helly property of hypergraphs, cliques, and bicliques ⋮ Unnamed Item ⋮ Characterization of classical graph classes by weighted clique graphs ⋮ Polynomial time recognition of squares of Ptolemaic graphs and 3-sun-free split graphs ⋮ The Colorful Helly Property for Hypergraphs ⋮ On the clique behavior and Hellyness of the complements of regular graphs
This page was built for publication: Complexity aspects of the Helly property: graphs and hypergraphs
