The following pages link to (Q4272121):
Displaying 13 items.
- On neighborhood-Helly graphs (Q344856) (← links)
- Fast deterministic algorithms for computing all eccentricities in (hyperbolic) Helly graphs (Q832869) (← links)
- \(r\)-dominating cliques in graphs with hypertree structure (Q1356657) (← links)
- Homogeneously orderable graphs (Q1392023) (← links)
- Incidence graphs of biacyclic hypergraphs (Q1923616) (← links)
- LexBFS-orderings of distance-hereditary graphs with application to the diametral pair problem (Q1962066) (← links)
- Injective hulls of various graph classes (Q2155861) (← links)
- Perfect elimination orderings for symmetric matrices (Q2174877) (← links)
- Complexity issues of perfect secure domination in graphs (Q5037201) (← links)
- A story of diameter, radius, and (almost) Helly property (Q6087123) (← links)
- The algorithmic use of hypertree structure and maximum neighbourhood orderings (Q6184359) (← links)
- LexBFS-orderings and powers of graphs (Q6550543) (← links)
- Fast deterministic algorithms for computing all eccentricities in (hyperbolic) Helly graphs (Q6671670) (← links)
