%0 Journal Article
%T Cop and robber game and hyperbolicity
%A J¨¦r¨¦mie Chalopin
%A Victor Chepoi
%A Panos Papasoglu
%A Timoth¨¦e Pecatte
%J Computer Science
%D 2013
%I arXiv
%X In this note, we prove that all cop-win graphs G in the game in which the robber and the cop move at different speeds s and s' with s'~~0, this establishes a new - game-theoretical - characterization of Gromov hyperbolicity. We also show that for weakly modular graphs the dependency between \delta and s is linear for any s'~~