R. Fabila-Monroy

activity

20092026

most citedToken Graphs

65 citations · 165 across the 33 of their papers we have counts for

collaborators

Showing 2011Show all

4 papers · 1 filter

math.CO2011★ 1 cited

Colouring the Triangles Determined by a Point Set

Ruy Fabila-Monroy, David R. Wood

Let P be a set of n points in general position in the plane. We study the chromatic number of the intersection graph of the open triangles determined by P. It is known that this ch…

math.CO2011★ 1 cited

Decompositions of Complete Multipartite Graphs into Complete Graphs

Ruy Fabila-Monroy, David R. Wood

Let $k \geq ℓ \geq 1$ and $n \geq 1$ be integers. Let $G (k, n)$ be the complete $k$ -partite graph with $n$ vertices in each colour class. An $ℓ$ -decomposition of $G (k, n)$ is a set…

math.CO2011

The chromatic number of the convex segment disjointness graph

Ruy Fabila-Monroy, David R. Wood

Let $P$ be a set of $n$ points in general and convex position in the plane. Let $D_{n}$ be the graph whose vertex set is the set of all line segments with endpoints in $P$ , where dis…

math.CO2011

Rooted $K_{4}$ -Minors

Ruy Fabila-Monroy, David R. Wood

Let $a, b, c, d$ be four vertices in a graph $G$ . A \emph{ $K_{4}$ -minor rooted} at $a, b, c, d$ consists of four pairwise-disjoint pairwise-adjacent connected subgraphs of $G$ , respectivel…

Colouring the Triangles Determined by a Point Set

Decompositions of Complete Multipartite Graphs into Complete Graphs

The chromatic number of the convex segment disjointness graph

Rooted K4​-Minors

Rooted $K_{4}$ -Minors