3 papers
math.CO2026
The Borsuk number of a graph
José Cáceres, Delia Garijo, Alberto Márquez +1
The Borsuk problem asks for the smallest number of subsets with strictly smaller diameters into which any bounded set in the -dimensional space can be decomposed. It is a classi…
cs.CG2026
On the complexity of covering points by guillotine cuts
Delia Garijo, Alberto Márquez, Rodrigo I. Silveira
We show that the problem of covering a set of points in the plane with a minimum number of guillotine cuts is NP-complete. To that end, first we present a new NP-completeness proof…
cs.CG2025
Algorithms for Distance Problems in Continuous Graphs
Sergio Cabello, Delia Garijo, Antonia Kalb +3
We study the problem of computing the diameter and the mean distance of a continuous graph, i.e., a connected graph where all points along the edges, instead of only the vertices,…