Modem Illumination of Monotone Polygons (2009)
Oswin Aichholzer, Ruy Fabila-monroy, David Flores-peñaloza, Thomas Hackl, Clemens Huemer, Jorge Urrutia, ...
We study a generalization of the classical problem of illumination of polygons. Instead of modeling a light source we model a wireless device whose radio signal can penetrate a given number k of...
Fabila-Monroy, Ruy, Flores-Peñaloza, David, Huemer, Clemens, Hurtado, Ferran, Urrutia, Jorge, Wood, David R.
For a graph $G$ and integer $k\geq1$, we define the token graph $F_k(G)$ to be the graph with vertex set all $k$-subsets of $V(G)$, where two vertices are adjacent in $F_k(G)$ whenever their...
On the Chromatic Numbers of some Flip Graphs (2008)
Ruy Fabila-monroy, David Flores-peñaloza, Clemens Huemer, Ferran Hurtado, Jorge Urrutia, David R. Wood
This paper studies the chromatic number of the following four flip graphs (under suitable definitions of a flip): • the flip graph of perfect matchings of a complete graph of even order, • the...