20 citations · 27 across the 8 of their papers we have counts for
8 papers
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…
Optimal Grid Drawings of Complete Multipartite Graphs and an Integer Variant of the Algebraic Connectivity
Ruy Fabila-Monroy, Carlos Hidalgo-Toscano, Clemens Huemer +2
How to draw the vertices of a complete multipartite graph on different points of a bounded -dimensional integer grid, such that the sum of squared distances between vertices…
On crossing families of complete geometric graphs
Dolores Lara, Christian Rubio-Montiel
A crossing family is a collection of pairwise crossing segments, this concept was introduced by Aronov et. al. (1994). They prove that any set of points (in general position) i…
Balanced partitions of 3-colored geometric sets in the plane
Sergey Bereg, Matias Korman, Rodrigo I. Silveira +6
Let be a finite set of geometric objects partitioned into classes or \emph{colors}. A subset is said to be \emph{balanced} if contains the same amount of e…
Coloring decompositions of complete geometric graphs
Clemens Huemer, Dolores Lara, Christian Rubio-Montiel
A decomposition of a non-empty simple graph is a pair , such that is a set of non-empty induced subgraphs of , and every edge of belongs to exactly one subgra…
Geometric achromatic and pseudoachromatic indices
O. Aichholzer, G. Araujo-Pardo, N. García-Colín +4
The pseudoachromatic index of a graph is the maximum number of colors that can be assigned to its edges, such that each pair of different colors is incident to a common vertex. If…