54 citations · 237 across the 33 of their papers we have counts for
7 papers · 1 filter
Isometric path complexity of graphs
Dibyayan Chakraborty, Jérémie Chalopin, Florent Foucaud +1
A set of isometric paths of a graph is ``-rooted'', where is a vertex of , if is one of the endpoints of all the isometric paths in . The isometric path co…
ABC(T)-graphs: an axiomatic characterization of the median procedure in graphs with connected and G-connected medians
Laurine Bénéteau, Jérémie Chalopin, Victor Chepoi +1
The median function is a location/consensus function that maps any profile (a finite multiset of vertices) to the set of vertices that minimize the distance sum to vertices fro…
First-order logic axiomatization of metric graph theory
Jérémie Chalopin, Manoj Changat, Victor Chepoi +1
The main goal of this note is to provide a First-Order Logic with Betweenness (FOLB) axiomatization of the main classes of graphs occurring in Metric Graph Theory, in analogy to Ta…
Graphs with -connected medians
Laurine Bénéteau, Jérémie Chalopin, Victor Chepoi +1
The median of a graph with weighted vertices is the set of all vertices minimizing the sum of weighted distances from to the vertices of . For any integer ,…
Restricted frame graphs and a conjecture of Scott
Jérémie Chalopin, Louis Esperet, Zhentao Li +1
Scott proved in 1997 that for any tree , every graph with bounded clique number which does not contain any subdivision of as an induced subgraph has bounded chromatic number…
Cop and robber game and hyperbolicity
Jérémie Chalopin, Victor Chepoi, Panos Papasoglu +1
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'<s, are δ-hyperbolic with δ=O(s^2). We also sh…