Jesús Leaños

From MaRDI portal
Person:1640217

Available identifiers

zbMath Open leanos.jesusMaRDI QIDQ1640217

List of research outcomes

PublicationDate of PublicationType
Disjointness graphs of segments in \(\mathbb{R}^2\) are almost all Hamiltonian2024-01-24Paper
The 3-symmetric pseudolinear crossing number of \(K_{36}\)2024-01-17Paper
The differential on Graph Operator R(G)2023-08-03Paper
On the connectivity of the disjointness graph of segments of point sets in general position in the plane2023-05-30Paper
On the Connectivity of Token Graphs of Trees2023-05-30Paper
The Maximum Chromatic Number of the Disjointness Graph of Segments on $n$-point Sets in the Plane with $n\leq 16$2023-03-30Paper
Bounded degree conjecture holds precisely for \(c\)-crossing-critical graphs with \(c \le 12\)2023-01-23Paper
The differential of the line graph \(\mathcal{L} (G)\)2022-09-15Paper
https://portal.mardi4nfdi.de/entity/Q50889412022-07-18Paper
A note on the minimum number of red lines needed to pierce the intersections of blue lines2022-04-08Paper
On the number of order types in integer grids of small size2021-09-16Paper
The edge-connectivity of token graphs2021-08-12Paper
The Chromatic Number of the Disjointness Graph of the Double Chain2020-10-28Paper
Independence and matching numbers of some token graphs2020-05-07Paper
\(\beta\)-differential of a graph2019-11-13Paper
On the differential polynomial of a graph2019-03-27Paper
Characterizing all graphs with 2-exceptional edges2019-03-27Paper
On the Number of Order Types in Integer Grids of Small Size2018-11-06Paper
The connectivity of token graphs2018-09-14Paper
The packing number of the double vertex graph of the path graph2018-09-06Paper
The complexity of computing the cylindrical and the \(t\)-circle crossing number of a graph2018-06-14Paper
Regularity and planarity of token graphs2017-07-17Paper
On the Pseudolinear Crossing Number2017-04-21Paper
On the Decay of Crossing Numbers of Sparse Graphs2016-02-01Paper
The $2nd-$convex hull of every optimal rectilinear drawing of $K_{n}$ is a triangle2014-11-02Paper
Crossing number additivity over edge cuts2014-04-11Paper
The Erd\H{o}s-S\'os Conjecture for Geometric Graphs2014-02-14Paper
https://portal.mardi4nfdi.de/entity/Q28574032013-11-01Paper
Convexifying Monotone Polygons while Maintaining Internal Visibility2013-01-07Paper
On the number of mth roots of permutations2012-10-21Paper
On \(\leq k\)-edges, crossings, and halving lines of geometric drawings of \(K _{n }\)2012-08-13Paper
Visibility-preserving convexifications using single-vertex moves2012-05-04Paper
Minor crossing number is additive over arbitrary cuts2011-11-25Paper
Point sets that minimize \((\leq k)\)-edges, 3-decomposable drawings, and the rectilinear crossing number of \(K_{30}\)2011-08-08Paper
Simple Euclidean arrangements with one (>=5)-gon2010-08-26Paper
3-symmetric and 3-decomposable geometric drawings of \(K_n\)2010-08-13Paper
The crossing number of a projective graph is quadratic in the face-width2009-04-07Paper
An extended lower bound on the number of(\(\leqslant k\))-edges to generalized configurations of points and the pseudolinear crossing number of \(K_n\)2008-12-08Paper
ON THE ADDITIVITY OF CROSSING NUMBERS OF GRAPHS2008-12-01Paper
The crossing number of a projective graph is quadratic in the face–width2008-06-05Paper
The maximum number of halving lines and the rectilinear crossing number of for2008-06-05Paper
A central approach to bound the number of crossings in a generalized configuration2008-06-05Paper
https://portal.mardi4nfdi.de/entity/Q54423752008-02-22Paper
Simple Euclidean arrangements with no \((\geq 5)\)-gons2008-01-04Paper
On 3-decomposable geometric drawings of $K_n$2007-12-27Paper
Combinatorial Geometry and Graph Theory2006-10-10Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Jesús Leaños