1 citations · 2 across the 6 of their papers we have counts for
7 papers
On the rectilinear crossing number of complete balanced multipartite graphs and layered graphs
Ruy Fabila-Monroy, Rosna Paul, Jenifer Viafara-Chanchi +1
A rectilinear drawing of a graph is a drawing of the graph in the plane in which the edges are drawn as straight-line segments. The rectilinear crossing number of a graph is the mi…
Bichromatic Perfect Matchings with Crossings
Oswin Aichholzer, Stefan Felsner, Rosna Paul +2
We consider bichromatic point sets with red and blue points and study straight-line bichromatic perfect matchings on them. We show that every such point set in convex posit…
Compatible Spanning Trees in Simple Drawings of
Oswin Aichholzer, Kristin Knorr, Wolfgang Mulzer +6
For a simple drawing of the complete graph , two (plane) subdrawings are compatible if their union is plane. Let be the set of all plane spanning trees on…
Rotation systems and simple drawings in surfaces
Rosna Paul, Gelasio Salazar, Alexandra Weinberger
Every simple drawing of a graph in the plane naturally induces a rotation system, but it is easy to exhibit a rotation system that does not arise from a simple drawing in the plane…
Flipping Plane Spanning Paths
Oswin Aichholzer, Kristin Knorr, Wolfgang Mulzer +3
Let be a planar point set in general position, and let be the set of all plane straight-line paths with vertex set . A flip on a path …
Edge Partitions of Complete Geometric Graphs (Part 2)
Oswin Aichholzer, Johannes Obenaus, Joachim Orthaber +5
Recently, the second and third author showed that complete geometric graphs on vertices in general cannot be partitioned into plane spanning trees. Building up on this wor…
Plane Spanning Trees in Edge-Colored Simple Drawings of
Oswin Aichholzer, Michael Hoffmann, Johannes Obenaus +5
Károlyi, Pach, and Tóth proved that every 2-edge-colored straight-line drawing of the complete graph contains a monochromatic plane spanning tree. It is open if this statement gene…