The location problem on graphs and the Helly problem

The authors constructed polynomial algorithms for the solution of the $p$-center problem and of the $r$-domination problem for graphs whose family of balls has the Helly property and whose intersection graph is triangulated. A characterization of this class of graphs is given as well.