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…
math.CO2025
Domination on Vertex-weighted Graphs Induce by a Coloring
MarÃa A. Garrido-Vizuete, Mucuy-kak Guevara, Alberto Márquez +1
This paper introduces the concept of domination in the context of colored graphs (where each color assigns a weight to the vertices of its class), termed up-color domination, where…