Pages that link to "Item:Q1960293"
From MaRDI portal
The following pages link to Complexity aspects of the Helly property: graphs and hypergraphs (Q1960293):
Displaying 14 items.
- A unified approach to recognize squares of split graphs (Q313959) (← links)
- On neighborhood-Helly graphs (Q344856) (← links)
- Split clique graph complexity (Q393107) (← links)
- The colorful Helly theorem and general hypergraphs (Q412268) (← links)
- Polynomial time recognition of squares of Ptolemaic graphs and 3-sun-free split graphs (Q497674) (← links)
- Fast deterministic algorithms for computing all eccentricities in (hyperbolic) Helly graphs (Q832869) (← links)
- On the clique behavior and Hellyness of the complements of regular graphs (Q2099476) (← links)
- On the computational complexity of the Helly number in the \(P_3\) and related convexities (Q2132356) (← links)
- Characterization of classical graph classes by weighted clique graphs (Q2448923) (← links)
- On the generalized Helly property of hypergraphs, cliques, and bicliques (Q2689646) (← links)
- The Colorful Helly Property for Hypergraphs (Q2851534) (← links)
- (Q3386616) (← links)
- Domination in digraphs and their direct and Cartesian products (Q6057645) (← links)
- A story of diameter, radius, and (almost) Helly property (Q6087123) (← links)
