Jesús Leaños

collaborators

2 papers

math.CO2023

The differential on Graph Operator R(G)

Ludwin A. Hernández, Jesús Leaños, Omar Rosario +1

Let $G = (V (G), E (G))$ be a simple graph with vertex set $V (G)$ and edge set $E (G)$ . Let $S$ be a subset of $V (G)$ , and let $B (S)$ be the set of neighbours of $S$ in $V(G) \setminus…

math.MG2014

The $2 n d -$ convex hull of every optimal rectilinear drawing of $K_{n}$ is a triangle

J. Leaños, M. Lomeli, M. Ramírez-Ibáñez +1

A rectilinear drawing of a graph $G$ is optimal if it has the smallest number of crossings among all rectilinear drawings of $G$ . In this paper it is shown that for $n \geq 8$ , the…

The differential on Graph Operator R(G)

The 2nd−convex hull of every optimal rectilinear drawing of Kn​ is a triangle

The $2 n d -$ convex hull of every optimal rectilinear drawing of $K_{n}$ is a triangle