The following pages link to Ruy Fabila-Monroy (Q591912):
Displayed 23 items.
- The Chromatic Number of the Disjointness Graph of the Double Chain (Q5130745) (← links)
- (Q5173161) (← links)
- NOTE ON THE NUMBER OF OBTUSE ANGLES IN POINT SETS (Q5247060) (← links)
- EMBEDDING THE DOUBLE CIRCLE IN A SQUARE GRID OF MINIMUM SIZE (Q5247065) (← links)
- Empty non-convex and convex four-gons in random point sets (Q5248389) (← links)
- Proximity graphs inside large weighted graphs (Q5326777) (← links)
- The Erd\H{o}s-S\'os Conjecture for Geometric Graphs (Q5747373) (← links)
- On the Connectedness and Diameter of a Geometric Johnson Graph (Q5747405) (← links)
- On the Connectivity of Token Graphs of Trees (Q6045414) (← links)
- Perfect matchings with crossings (Q6119827) (← links)
- Decompositions of Complete Multipartite Graphs into Complete Graphs (Q6227799) (← links)
- Extremal antipodal polygons and polytopes (Q6239154) (← links)
- Drawing the double circle on a grid of minimum size (Q6242261) (← links)
- Non-crossing Monotone Paths and Binary Trees in Edge-ordered Complete Geometric Graphs (Q6284379) (← links)
- The exact chromatic number of the convex segment disjointness graph (Q6299917) (← links)
- Optimal Grid Drawings of Complete Multipartite Graphs and an Integer Variant of the Algebraic Connectivity (Q6305869) (← links)
- On the Number of Order Types in Integer Grids of Small Size (Q6309291) (← links)
- On the 2-colored crossing number (Q6323828) (← links)
- Empty Rainbow Triangles in $k$-colored Point Sets (Q6345177) (← links)
- Connected ($C_4$,Diamond)-free Graphs Are Uniquely Reconstructible from Their Token Graphs (Q6405996) (← links)
- A Note on the $k$-colored Crossing Ratio of Dense Geometric Graphs (Q6423680) (← links)
- A Note on the 2-Colored Rectilinear Crossing Number of Random Point Sets in the Unit Square (Q6462093) (← links)
- A Note on the Asymptotic Value of the Isoperimetric Number of $J(n,2)$ (Q6462358) (← links)