We extend known results on chordal graphs and distance-hereditary graphs...
A graph is Helly if every family of pairwise intersecting balls has a
no...
A graph is Helly if its disks satisfy the Helly property, i.e., every fa...
A new metric parameter for a graph, Helly-gap, is introduced. A graph G ...
A graph G=(V,E) is δ-hyperbolic if for any four vertices u,v,w,x,
the tw...
A graph is Helly if every family of pairwise intersecting balls has a
no...
A graph G = (V,E) is distance hereditary if every induced path of G is a...
We show that the eccentricities (and thus the centrality indices) of all...
In this paper, we study Gromov hyperbolicity and related parameters, tha...
It is known that for every graph G there exists the smallest Helly graph...