Jesús Leaños

45 papers A* 1Journal 42Unranked 2
YearRankTypeTitle / Venue / Authors
2026 J jnl
Distribution of the null coefficients of the differential polynomial of the tree graphs.
Discret. Appl. Math.
J. J. García-Dávila, Jesús Leaños, J. M. Pacheco-Torres
2026 J jnl
On the differential of the graph operator S k ( G ).
Discret. Appl. Math.
J. J. García-Dávila, Jesús Leaños, J. M. Pacheco-Torres, Mario Lomelí-Haro
2024 J jnl
Disjointness graphs of segments in R2 are almost all hamiltonian.
Discret. Appl. Math.
Jesús Leaños, Christophe Ndjatchi, Luis Manuel Ríos-Castro
2024 J jnl
The 3-symmetric pseudolinear crossing number of
Discret. Math.
Omar de Avila-Martínez, Jesús Leaños, Carolina Medina
2024 J jnl
There is a unique crossing-minimal rectilinear drawing of K_18.
Ars Math. Contemp.
Bernardo M. Ábrego, Silvia Fernández-Merchant, Oswin Aichholzer, Jesús Leaños, Gelasio Salazar
2022 J jnl
A note on the minimum number of red lines needed to pierce the intersections of blue lines.
Comput. Geom.
Mario Huicochea, Jesús Leaños, Luis Manuel Rivera
2022 J jnl
Bounded Degree Conjecture Holds Precisely for c-Crossing-Critical Graphs with c ≤ 12.
Comb.
Drago Bokal, Zdenek Dvorák, Petr Hlinený, Jesús Leaños, Bojan Mohar, Tilo Wiedera
2022 J jnl
On the Connectivity of Token Graphs of Trees.
Discret. Math. Theor. Comput. Sci.
Ruy Fabila-Monroy, Jesús Leaños, Ana Laura Trujillo-Negrete
2022 J jnl
On the connectivity of the disjointness graph of segments of point sets in general position in the plane.
Discret. Math. Theor. Comput. Sci.
Jesús Leaños, Christophe Ndjatchi, Luis Manuel Ríos-Castro
2022 J jnl
The differential of the line graph L(G).
Discret. Appl. Math.
Ludwin A. Basilio, Sergio Bermudo, Jesús Leaños, José María Sigarreta
2021 J jnl
An Upper Bound Asymptotically Tight for the Connectivity of the Disjointness Graph of Segments in the Plane.
Symmetry
Aurora Espinoza-Valdez, Jesús Leaños, Christophe Ndjatchi, Luis Manuel Ríos-Castro
2021 J jnl
On the number of order types in integer grids of small size.
Comput. Geom.
Luis Evaristo Caraballo, José Miguel Díaz-Báñez, Ruy Fabila-Monroy, Carlos Hidalgo-Toscano, Jesús Leaños, Amanda Montejano
2021 J jnl
The Edge-Connectivity of Token Graphs.
Graphs Comb.
Jesús Leaños, Christophe Ndjatchi
2020 J jnl
Independence and matching numbers of some token graphs.
Australas. J Comb.
Hernán de Alba, Walter Carballosa, Jesús Leaños, Luis Manuel Rivera
2020 J jnl
The Chromatic Number of the Disjointness Graph of the Double Chain.
Discret. Math. Theor. Comput. Sci.
Ruy Fabila-Monroy, Carlos Hidalgo-Toscano, Jesús Leaños, Mario Lomelí-Haro
2020 J jnl
The Differential on Graph Operator Q(G).
Symmetry
Ludwin A. Basilio, Jair Castro Simón, Jesús Leaños, Omar Rosario Cayetano
2019 A* conf
Bounded Degree Conjecture Holds Precisely for c-Crossing-Critical Graphs with c <= 12.
SoCG
Drago Bokal, Zdenek Dvorák, Petr Hlinený, Jesús Leaños, Bojan Mohar, Tilo Wiedera
2019 J jnl
Bounded maximum degree conjecture holds precisely for c-crossing-critical graphs with c≤12.
CoRR
Drago Bokal, Zdenek Dvorák, Petr Hlinený, Jesús Leaños, Bojan Mohar, Tilo Wiedera
2018 J jnl
Characterizing all graphs with 2-exceptional edges.
Ars Math. Contemp.
Drago Bokal, Jesús Leaños
2018 J jnl
On the Number of Order Types in Integer Grids of Small Size.
CoRR
Luis Evaristo Caraballo, José Miguel Díaz-Báñez, Ruy Fabila-Monroy, Carlos Hidalgo-Toscano, Jesús Leaños, Amanda Montejano
2018 J jnl
The Complexity of Computing the Cylindrical and the t-Circle Crossing Number of a Graph.
Electron. J. Comb.
Frank Duque, Hernán González-Aguilar, César Hernández-Vélez, Jesús Leaños, Carolina Medina
2018 J jnl
The Connectivity of Token Graphs.
Graphs Comb.
Jesús Leaños, Ana Laura Trujillo-Negrete
2018 J jnl
The packing number of the double vertex graph of the path graph.
Discret. Appl. Math.
José Manuel Gómez Soto, Jesús Leaños, Luis Manuel Ríos-Castro, Luis Manuel Rivera
2017 J jnl
On the Pseudolinear Crossing Number.
J. Graph Theory
César Hernández-Vélez, Jesús Leaños, Gelasio Salazar
2017 J jnl
Regularity and planarity of token graphs.
Discuss. Math. Graph Theory
Walter Carballosa, Ruy Fabila-Monroy, Jesús Leaños, Luis Manuel Rivera-Martínez
2015 J jnl
On the Decay of Crossing Numbers of Sparse Graphs.
J. Graph Theory
József Balogh, Jesús Leaños, Gelasio Salazar
2013 J jnl
Crossing number additivity over edge cuts.
Eur. J. Comb.
Drago Bokal, Markus Chimani, Jesús Leaños
2013 J jnl
The Erdős-Sós Conjecture for Geometric Graphs.
Discret. Math. Theor. Comput. Sci.
Ruy Fabila-Monroy, Luis Felipe Barba Flores, Dolores Lara, Jesús Leaños, Cynthia A. Rodríguez Villalobos, Gelasio Salazar, Francisco Zaragoza
2012 J jnl
On the number of
Australas. J Comb.
Jesús Leaños, Rutilo Moreno, Luis Manuel Rivera-Martínez
2012 J jnl
On ≤k-Edges, Crossings, and Halving Lines of Geometric Drawings of K n.
Discret. Comput. Geom.
Bernardo M. Ábrego, Mario Cetina, Silvia Fernández-Merchant, Jesús Leaños, Gelasio Salazar
2012 J jnl
Visibility-preserving convexifications using single-vertex moves.
Inf. Process. Lett.
Bernardo M. Ábrego, Mario Cetina, Jesús Leaños, Gelasio Salazar
2011 — conf
Convexifying Monotone Polygons while Maintaining Internal Visibility.
EGC
Oswin Aichholzer, Mario Cetina, Ruy Fabila-Monroy, Jesús Leaños, Gelasio Salazar, Jorge Urrutia
2011 J jnl
On $(\le k)$-edges, crossings, and halving lines of geometric drawings of K
CoRR
Bernardo M. Ábrego, Mario Cetina, Silvia Fernández-Merchant, Jesús Leaños, Gelasio Salazar
2011 J jnl
Point sets that minimize (≤k)-edges, 3-decomposable drawings, and the rectilinear crossing number of K
Discret. Math.
Mario Cetina, César Hernández-Vélez, Jesús Leaños, C. Villalobos
2011 J jnl
There is a unique crossing-minimal rectilinear drawing of K
Electron. Notes Discret. Math.
Oswin Aichholzer, Bernardo M. Ábrego, Silvia Fernández-Merchant, Jesús Leaños, Gelasio Salazar
2011 J jnl
Visibility-preserving convexifications using single-vertex moves
CoRR
Bernardo M. Ábrego, Mario Cetina, Jesús Leaños, Gelasio Salazar
2010 J jnl
3-symmetric and 3-decomposable geometric drawings of K
Discret. Appl. Math.
Bernardo M. Ábrego, Mario Cetina, Silvia Fernández-Merchant, Jesús Leaños, Gelasio Salazar
2008 J jnl
A central approach to bound the number of crossings in a generalized configuration.
Electron. Notes Discret. Math.
Bernardo M. Ábrego, Silvia Fernández-Merchant, Jesús Leaños, Gelasio Salazar
2008 J jnl
An extended lower bound on the number of (k)-edges to generalized configurations of points and the pseudolinear crossing number of K
J. Comb. Theory A
Bernardo M. Ábrego, József Balogh, Silvia Fernández-Merchant, Jesús Leaños, Gelasio Salazar
2008 J jnl
The Crossing Number of a Projective Graph is Quadratic in the Face-Width.
Electron. J. Comb.
Isidoro Gitler, Petr Hlinený, Jesús Leaños, Gelasio Salazar
2008 J jnl
The maximum number of halving lines and the rectilinear crossing number of K
Electron. Notes Discret. Math.
Bernardo M. Ábrego, Silvia Fernández-Merchant, Jesús Leaños, Gelasio Salazar
2007 J jnl
Simple Euclidean Arrangements with No (>= 5)-Gons.
Discret. Comput. Geom.
Jesús Leaños, Mario Lomelí-Haro, Criel Merino, Gelasio Salazar, Jorge Urrutia
2007 J jnl
The convex hull of every optimal pseudolinear drawing of K
Australas. J Comb.
József Balogh, Jesús Leaños, Shengjun Pan, R. Bruce Richter, Gelasio Salazar
2007 J jnl
The crossing number of a projective graph is quadratic in the face-width.
Electron. Notes Discret. Math.
Isidoro Gitler, Petr Hlinený, Jesús Leaños, Gelasio Salazar
2003 — conf
Spanning Trees of Multicoloured Point Sets with Few Intersections.
IJCCGGT
Jesús Leaños, Criel Merino, Gelasio Salazar, Jorge Urrutia