3 citations · 4 across the 2 of their papers we have counts for
2 papers
math.CO2023★ 1 cited
Separating path systems in trees
Francisco Arrepol, Patricio Asenjo, Raúl Astete +6
For a graph , an edge-separating (resp. vertex-separating) path system of is a family of paths in such that for any pair of edges (resp. pair of vertices $v_1…
math.CO2019★ 3 cited
The Weighted Sitting Closer to Friends than Enemies Problem in the Line
Julio Aracena, Christopher Thraves Caro
The weighted \emph{Sitting Closer to Friends than Enemies} (SCFE) problem is to find an injection of the vertex set of a given weighted graph into a given metric space so that, for…