Luis Manuel Ríos-Castro

collaborators

3 papers

math.CO2025

Mutual-visibility of the disjointness graph of segments in $R^{2}$

J. Leaños, M. Lomelí-Haro, Christophe Ndjatchi +1

Let $G = (V (G), E (G))$ be a simple graph, and let $U \subseteq V (G)$ . Two distinct vertices $x, y \in U$ are $U$ -mutually visible if $G$ contains a shortest $x$ - $y$ path that is internal…

math.CO2023

Disjointness Graphs of segments in $R^{2}$ are almost all Hamiltonian

J. Leaños, Christophe Ndjatchi, L. M. Ríos-Castro

Let $P$ be a set of $n \geq 2$ points in general position in $R^{2}$ . The edge disjointness graph $D (P)$ of $P$ is the graph whose vertices are all the closed straight line segments w…

math.CO2023

The Maximum Chromatic Number of the Disjointness Graph of Segments on $n$ -point Sets in the Plane with $n \leq 16$

Jesús García-Davila, Jesús Leaños, Mario Lomelí-Haro +1

Let $P$ be a finite set of points in general position in the plane. The disjointness graph of segments $D (P)$ of $P$ is the graph whose vertices are all the closed straight line se…

Mutual-visibility of the disjointness graph of segments in R2

Disjointness Graphs of segments in R2 are almost all Hamiltonian

The Maximum Chromatic Number of the Disjointness Graph of Segments on n-point Sets in the Plane with n≤16

Mutual-visibility of the disjointness graph of segments in $R^{2}$

Disjointness Graphs of segments in $R^{2}$ are almost all Hamiltonian

The Maximum Chromatic Number of the Disjointness Graph of Segments on $n$ -point Sets in the Plane with $n \leq 16$