Pages that link to "Item:Q2379939"
From MaRDI portal
The following pages link to Faster recognition of clique-Helly and hereditary clique-Helly graphs (Q2379939):
Displaying 13 items.
- On neighborhood-Helly graphs (Q344856) (← links)
- The chromatic gap and its extremes (Q713979) (← links)
- Fast deterministic algorithms for computing all eccentricities in (hyperbolic) Helly graphs (Q832869) (← links)
- Improved algorithms for recognizing \(p\)-Helly and hereditary \(p\)-Helly hypergraphs (Q975464) (← links)
- On edge-sets of bicliques in graphs (Q1759846) (← links)
- On the clique behavior and Hellyness of the complements of regular graphs (Q2099476) (← links)
- Helly-gap of a graph and vertex eccentricities (Q2663046) (← links)
- Beyond Helly graphs: the diameter problem on absolute retracts (Q2672446) (← links)
- Distance problems within Helly graphs and \(k\)-Helly graphs (Q2682928) (← links)
- On the generalized Helly property of hypergraphs, cliques, and bicliques (Q2689646) (← links)
- On minimal forbidden subgraph characterizations of balanced graphs (Q5920323) (← links)
- A story of diameter, radius, and (almost) Helly property (Q6087123) (← links)
- Fast deterministic algorithms for computing all eccentricities in (hyperbolic) Helly graphs (Q6671670) (← links)
