J. Leaños

activity

20072026

most citedRegularity and Planarity of Token Graphs

32 citations · 77 across the 23 of their papers we have counts for

collaborators

27 papers

math.CO2026

Blow-ups of order types of positive density

Ruy Fabila-Monroy, Benedikt Hahn, Jesús Leaños

Order types are an equivalence relation between point configurations that capture their combinatorial and convexity properties. Let $P$ be a $κ$ -colored sequence of $n \geq d + 1$ poi…

math.CO2026

Corrections to classical results on Independence and Covering numbers of the Splitting graph

J. Castro, J. Leaños, O. Rosario

The splitting graph $S (G)$ of a finite simple graph $G$ was introduced by Sampathkumar and Walikar in 1980~\cite{SW1980} and has been extensively studied in relation to graph invar…

math.CO2026

An asymptotically tight upper bound for the domination number of the $2$ -token graph of path graphs

E. Acosta Troncoso, J. Leaños, L. M. Rivera

In this note, we show that the domination number of the $2$ -token graph of the path graph of order $n \geq 2$ is equal to $\frac{n ^{2}}{10} + Θ (n)$ .

math.CO2026

The 3-symmetric Pseudolinear Crossing Number of $K_{33}$

Víctor H. Gómez Martínez, César Hernández-Vélez, Jesús Leaños

We show that the 3-symmetric rectilinear and the 3-symmetric pseudolinear crossing numbers of $K_{33}$ are equal. Specifically, we prove that $\operatorname{sym}-\overline{\operato…

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…

Blow-ups of order types of positive density

Corrections to classical results on Independence and Covering numbers of the Splitting graph

An asymptotically tight upper bound for the domination number of the 2-token graph of path graphs

The 3-symmetric Pseudolinear Crossing Number of K33​

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

An asymptotically tight upper bound for the domination number of the $2$ -token graph of path graphs

The 3-symmetric Pseudolinear Crossing Number of $K_{33}$

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$