6 citations · 7 across the 6 of their papers we have counts for
12 papers
Fast deterministic algorithms for computing all eccentricities in (hyperbolic) Helly graphs
Feodor F. Dragan, Guillaume Ducoffe, Heather M. Guarnera
A graph is Helly if every family of pairwise intersecting balls has a nonempty common intersection. The class of Helly graphs is the discrete analogue of the class of hyperconvex m…
Injective hulls of various graph classes
Heather M. Guarnera, Feodor F. Dragan, Arne Leitert
A graph is Helly if its disks satisfy the Helly property, i.e., every family of pairwise intersecting disks in G has a common intersection. It is known that for every graph G, ther…
Helly-gap of a graph and vertex eccentricities
Feodor F. Dragan, Heather M. Guarnera
A new metric parameter for a graph, Helly-gap, is introduced. A graph is called -weakly-Helly if any system of pairwise intersecting disks in has a nonempty common inter…
Eccentricity terrain of -hyperbolic graphs
Feodor F. Dragan, Heather M. Guarnera
A graph is -hyperbolic if for any four vertices , the two larger of the three distance sums , , and differ by at…
A story of diameter, radius and Helly property
Feodor F. Dragan, Guillaume Ducoffe
A graph is Helly if every family of pairwise intersecting balls has a nonempty common intersection. Motivated by previous work on dually chordal graphs and graphs of bounded distan…
Eccentricity function in distance-hereditary graphs
Feodor F. Dragan, Heather M. Guarnera
A graph is distance hereditary if every induced path of is a shortest path. In this paper, we show that the eccentricity function in any…