1 citations · 1 across the 2 of their papers we have counts for
3 papers
math.CO2025
On Grundy indices for complete geometric graphs
Dolores Lara, Christian Rubio-Montiel, Francisco Zaragoza
The pseudo-Grundy index of a graph is the largest number of colors that can be assigned to its edges, such that for every pair of colors , if then every edge colored w…
cs.CG2019
On the 2-colored crossing number
Oswin Aichholzer, Ruy Fabila-Monroy, Adrian Fuchs +4
Let be a straight-line drawing of a graph. The rectilinear 2-colored crossing number of is the minimum number of crossings between edges of the same color, taken over all p…
math.CO2012★ 1 cited
The Erdős-Sós Conjecture for Geometric Graphs
Luis F. Barba, Ruy Fabila-Monroy, Dolores Lara +4
Let be the minimum number of edges that must be removed from some complete geometric graph on points, so that there exists a tree on vertices that is no longer…