J. Leaños

From MaRDI portal
(Redirected from Person:1640217)



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
Distribution of the null coefficients of the differential polynomial of the tree graphs
Discrete Applied Mathematics
2025-11-04Paper
The maximum chromatic number of the disjointness graph of segments on \(n\)-point sets in the plane with \(n\leq 16\)
Boletín de la Sociedad Matemática Mexicana. Third Series
2024-10-07Paper
There is a unique crossing-minimal rectilinear drawing of \(K_{18}\)
Ars Mathematica Contemporanea
2024-05-29Paper
Disjointness graphs of segments in \(\mathbb{R}^2\) are almost all Hamiltonian
Discrete Applied Mathematics
2024-01-24Paper
The 3-symmetric pseudolinear crossing number of \(K_{36}\)
Discrete Mathematics
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 plane
Discrete Mathematics & Theoretical Computer Science
2023-05-30Paper
On the Connectivity of Token Graphs of Trees
Discrete Mathematics & Theoretical Computer Science
2023-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\)
Combinatorica
2023-01-23Paper
The differential of the line graph \(\mathcal{L} (G)\)
Discrete Applied Mathematics
2022-09-15Paper
scientific article; zbMATH DE number 7559214 (Why is no real title available?)
(available as arXiv preprint)
2022-07-18Paper
A note on the minimum number of red lines needed to pierce the intersections of blue lines
Computational Geometry
2022-04-08Paper
On the number of order types in integer grids of small size
Computational Geometry
2021-09-16Paper
The edge-connectivity of token graphs
Graphs and Combinatorics
2021-08-12Paper
The Chromatic Number of the Disjointness Graph of the Double Chain
(available as arXiv preprint)
2020-10-28Paper
Independence and matching numbers of some token graphs2020-05-07Paper
Independence and matching numbers of some token graphs
(available as arXiv preprint)
2020-05-07Paper
\(\beta\)-differential of a graph
Symmetry
2019-11-13Paper
On the differential polynomial of a graph
Acta Mathematica Sinica, English Series
2019-03-27Paper
Characterizing all graphs with 2-exceptional edges
Ars Mathematica Contemporanea
2019-03-27Paper
On the Number of Order Types in Integer Grids of Small Size
(available as arXiv preprint)
2018-11-06Paper
The connectivity of token graphs
Graphs and Combinatorics
2018-09-14Paper
The packing number of the double vertex graph of the path graph
Discrete Applied Mathematics
2018-09-06Paper
The complexity of computing the cylindrical and the \(t\)-circle crossing number of a graph
The Electronic Journal of Combinatorics
2018-06-14Paper
The complexity of computing the cylindrical and the \(t\)-circle crossing number of a graph
The Electronic Journal of Combinatorics
2018-06-14Paper
Regularity and planarity of token graphs
Discussiones Mathematicae Graph Theory
2017-07-17Paper
On the Pseudolinear Crossing Number
Journal of Graph Theory
2017-04-21Paper
On the decay of crossing numbers of sparse graphs
Journal of Graph Theory
2016-02-01Paper
The $2nd-$convex hull of every optimal rectilinear drawing of $K_{n}$ is a triangle2014-11-02Paper
Crossing number additivity over edge cuts
European Journal of Combinatorics
2014-04-11Paper
The Erdős-Sós conjecture for geometric graphs
(available as arXiv preprint)
2014-02-14Paper
The Erdős-Sós conjecture for geometric graphs2014-02-14Paper
There is a unique crossing-minimal rectilinear drawing of \(K_{18}\)2013-11-01Paper
Convexifying monotone polygons while maintaining internal visibility
Lecture Notes in Computer Science
2013-01-07Paper
On the number of \(m\)th roots of permutations
(available as arXiv preprint)
2012-10-21Paper
On \(\leq k\)-edges, crossings, and halving lines of geometric drawings of \(K _{n }\)
Discrete & Computational Geometry
2012-08-13Paper
Visibility-preserving convexifications using single-vertex moves
Information Processing Letters
2012-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}\)
Discrete Mathematics
2011-08-08Paper
Simple Euclidean arrangements with one (>=5)-gon2010-08-26Paper
3-symmetric and 3-decomposable geometric drawings of \(K_n\)
Discrete Applied Mathematics
2010-08-13Paper
The crossing number of a projective graph is quadratic in the face-width
The Electronic Journal of Combinatorics
2009-04-07Paper
The crossing number of a projective graph is quadratic in the face-width
The Electronic Journal of Combinatorics
2009-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\)
Journal of Combinatorial Theory. Series A
2008-12-08Paper
ON THE ADDITIVITY OF CROSSING NUMBERS OF GRAPHS
Journal of Knot Theory and Its Ramifications
2008-12-01Paper
The maximum number of halving lines and the rectilinear crossing number of for
Electronic Notes in Discrete Mathematics
2008-06-05Paper
A central approach to bound the number of crossings in a generalized configuration
Electronic Notes in Discrete Mathematics
2008-06-05Paper
The crossing number of a projective graph is quadratic in the face–width
Electronic Notes in Discrete Mathematics
2008-06-05Paper
scientific article; zbMATH DE number 5238988 (Why is no real title available?)2008-02-22Paper
Simple Euclidean arrangements with no \((\geq 5)\)-gons
Discrete & Computational Geometry
2008-01-04Paper
On 3-decomposable geometric drawings of $K_n$2007-12-27Paper
Combinatorial Geometry and Graph Theory
Lecture Notes in Computer Science
2006-10-10Paper


Research outcomes over time


This page was built for person: J. Leaños