1 citations · 1 across the 1 of their papers we have counts for
4 papers
On the Laplacian spectra of token graphs
C. Dalfó, F. Duque, R. Fabila-Monroy +4
We study the Laplacian spectrum of token graphs, also called symmetric powers of graphs. The -token graph of a graph is the graph whose vertices are the -subsets…
An Ongoing Project to Improve the Rectilinear and the Pseudolinear Crossing Constants
Oswin Aichholzer, Frank Duque, Ruy Fabila-Monroy +2
A drawing of a graph in the plane is {\it pseudolinear} if the edges of the drawing can be extended to doubly-infinite curves that form an arrangement of pseudolines, that is, any…
Counting the Number of Crossings in Geometric Graphs
Frank Duque, Ruy Fabila-Monroy, César Hernández-Vélez +1
A geometric graph is a graph whose vertices are points in general position in the plane and its edges are straight line segments joining these points. In this paper we give an $O(n…
Drawing the Almost Convex Set in an Integer Grid of Minimum Size
Frank Duque, Ruy Fabila-Monroy, Carlos Hidalgo-Toscano +1
In 2001, Károlyi, Pach and Tóth introduced a family of point sets to solve an Erdős-Szekeres type problem; which have been used to solve several other Edős-Szekeres type problems.…