Jesús Leaños

According to our database, Jesús Leaños authored at least 39 papers between 2003 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

The 3-symmetric pseudolinear crossing number of <i>K</i>₃₆.

Omar de Avila-Martínez, Jesús Leaños, Carolina Medina

Discret. Math., March, 2024

Disjointness graphs of segments in R2 are almost all hamiltonian.

Jesús Leaños, Christophe Ndjatchi, Luis Manuel Ríos-Castro

Discret. Appl. Math., January, 2024

2022

On the Connectivity of Token Graphs of Trees.

Ruy Fabila Monroy, Jesús Leaños, Ana Laura Trujillo-Negrete

Discret. Math. Theor. Comput. Sci., 2022

On the connectivity of the disjointness graph of segments of point sets in general position in the plane.

Jesús Leaños, Christophe Ndjatchi, Luis Manuel Ríos-Castro

Discret. Math. Theor. Comput. Sci., 2022

The differential of the line graph L(G).

Ludwin A. Basilio, Sergio Bermudo, Jesús Leaños, José María Sigarreta

Discret. Appl. Math., 2022

A note on the minimum number of red lines needed to pierce the intersections of blue lines.

Mario Huicochea, Jesús Leaños, Luis Manuel Rivera

Comput. Geom., 2022

Bounded Degree Conjecture Holds Precisely for c-Crossing-Critical Graphs with c ≤ 12.

Drago Bokal, Zdenek Dvorák, Petr Hlinený, Jesús Leaños, Bojan Mohar, Tilo Wiedera

Comb., 2022

2021

An Upper Bound Asymptotically Tight for the Connectivity of the Disjointness Graph of Segments in the Plane.

Aurora Espinoza-Valdez, Jesús Leaños, Christophe Ndjatchi, Luis Manuel Ríos-Castro

Symmetry, 2021

The Edge-Connectivity of Token Graphs.

Jesús Leaños, Christophe Ndjatchi

Graphs Comb., 2021

On the number of order types in integer grids of small size.

Luis Evaristo Caraballo, José Miguel Díaz-Báñez, Ruy Fabila Monroy, Carlos Hidalgo-Toscano, Jesús Leaños, Amanda Montejano

Comput. Geom., 2021

2020

The Differential on Graph Operator Q(G).

Ludwin A. Basilio, Jair Simon, Jesús Leaños, Omar Rosario Cayetano

Symmetry, 2020

The Chromatic Number of the Disjointness Graph of the Double Chain.

Ruy Fabila Monroy, Carlos Hidalgo-Toscano, Jesús Leaños, Mario Lomelí-Haro

Discret. Math. Theor. Comput. Sci., 2020

Independence and matching numbers of some token graphs.

Hernán de Alba, Walter Carballosa, Jesús Leaños, Luis Manuel Rivera

Australas. J Comb., 2020

2019

Bounded maximum degree conjecture holds precisely for c-crossing-critical graphs with c≤12.

Drago Bokal, Zdenek Dvorák, Petr Hlinený, Jesús Leaños, Bojan Mohar, Tilo Wiedera

CoRR, 2019

2018

The Connectivity of Token Graphs.

Jesús Leaños, Ana Laura Trujillo-Negrete

Graphs Comb., 2018

The packing number of the double vertex graph of the path graph.

José Manuel Gómez Soto, Jesús Leaños, Luis Manuel Ríos-Castro, Luis Manuel Rivera

Discret. Appl. Math., 2018

The Complexity of Computing the Cylindrical and the t-Circle Crossing Number of a Graph.

Frank Duque, Hernán González-Aguilar, César Hernández-Vélez, Jesús Leaños, Carolina Medina

Electron. J. Comb., 2018

Characterizing all graphs with 2-exceptional edges.

Drago Bokal, Jesús Leaños

Ars Math. Contemp., 2018

2017

<i>β</i>-Differential of a Graph.

Ludwin A. Basilio, Sergio Bermudo, Jesús Leaños, José María Sigarreta

Symmetry, 2017

On the Pseudolinear Crossing Number.

César Hernández-Vélez, Jesús Leaños, Gelasio Salazar

J. Graph Theory, 2017

Regularity and planarity of token graphs.

Walter Carballosa, Ruy Fabila Monroy, Jesús Leaños, Luis Manuel Rivera-Martínez

Discuss. Math. Graph Theory, 2017

2015

On the Decay of Crossing Numbers of Sparse Graphs.

József Balogh, Jesús Leaños, Gelasio Salazar

J. Graph Theory, 2015

2013

Crossing number additivity over edge cuts.

Drago Bokal, Markus Chimani, Jesús Leaños

Eur. J. Comb., 2013

The Erdős-Sós Conjecture for Geometric Graphs.

Ruy Fabila Monroy, Luis Felipe Barba Flores, Dolores Lara, Jesús Leaños, Cynthia A. Rodríguez Villalobos, Gelasio Salazar, Francisco Zaragoza

Discret. Math. Theor. Comput. Sci., 2013

2012

Visibility-preserving convexifications using single-vertex moves.

Bernardo M. Ábrego, Mario Cetina, Jesús Leaños, Gelasio Salazar

Inf. Process. Lett., 2012

On ≤k-Edges, Crossings, and Halving Lines of Geometric Drawings of K n.

Bernardo M. Ábrego, Mario Cetina, Silvia Fernández-Merchant, Jesús Leaños, Gelasio Salazar

Discret. Comput. Geom., 2012

On the number of <i>m</i>th roots of permutations.

Jesús Leaños, Rutilo Moreno, Luis Manuel Rivera-Martínez

Australas. J Comb., 2012

2011

There is a unique crossing-minimal rectilinear drawing of K₁₈.

Oswin Aichholzer, Bernardo M. Ábrego, Silvia Fernández-Merchant, Jesús Leaños, Gelasio Salazar

Electron. Notes Discret. Math., 2011

Point sets that minimize (≤k)-edges, 3-decomposable drawings, and the rectilinear crossing number of K₃₀.

Mario Cetina, César Hernández-Vélez, Jesús Leaños, C. Villalobos

Discret. Math., 2011

On $(\le k)$-edges, crossings, and halving lines of geometric drawings of K_n

Bernardo M. Ábrego, Mario Cetina, Silvia Fernández-Merchant, Jesús Leaños, Gelasio Salazar

CoRR, 2011

Convexifying Monotone Polygons while Maintaining Internal Visibility.

Oswin Aichholzer, Mario Cetina, Ruy Fabila Monroy, Jesús Leaños, Gelasio Salazar, Jorge Urrutia

Proceedings of the Computational Geometry - XIV Spanish Meeting on Computational Geometry, 2011

2010

3-symmetric and 3-decomposable geometric drawings of K_n.

Bernardo M. Ábrego, Mario Cetina, Silvia Fernández-Merchant, Jesús Leaños, Gelasio Salazar

Discret. Appl. Math., 2010

2008

An extended lower bound on the number of (k)-edges to generalized configurations of points and the pseudolinear crossing number of K_n.

Bernardo M. Ábrego, József Balogh, Silvia Fernández-Merchant, Jesús Leaños, Gelasio Salazar

J. Comb. Theory, Ser. A, 2008

A central approach to bound the number of crossings in a generalized configuration.

Bernardo M. Ábrego, Silvia Fernández-Merchant, Jesús Leaños, Gelasio Salazar

Electron. Notes Discret. Math., 2008

The maximum number of halving lines and the rectilinear crossing number of K_n for n.

Bernardo M. Ábrego, Silvia Fernández-Merchant, Jesús Leaños, Gelasio Salazar

Electron. Notes Discret. Math., 2008

2007

The crossing number of a projective graph is quadratic in the face-width.

Isidoro Gitler, Petr Hlinený, Jesús Leaños, Gelasio Salazar

Electron. Notes Discret. Math., 2007

Simple Euclidean Arrangements with No (>= 5)-Gons.

Jesús Leaños, Mario Lomelí-Haro, Criel Merino, Gelasio Salazar, Jorge Urrutia

Discret. Comput. Geom., 2007

The convex hull of every optimal pseudolinear drawing of K_n is a triangle.

József Balogh, Jesús Leaños, Shengjun Pan, R. Bruce Richter, Gelasio Salazar

Australas. J Comb., 2007

2003

Spanning Trees of Multicoloured Point Sets with Few Intersections.

Jesús Leaños, Criel Merino, Gelasio Salazar, Jorge Urrutia

Proceedings of the Combinatorial Geometry and Graph Theory, 2003