Birgit Vogtenhuber

collaborators

5 papers

math.CO2025

Monotonically Decreasing the Number of Directed 3-Cycles via Edge-Flips?

David Bom, Florian Unger, Birgit Vogtenhuber

We investigate a combinatorial reconfiguration problem on oriented graphs, where a reconfiguration step (edge-flip) is the inversion of the orientation of a single edge. A recently…

math.CO2025

Crossing and non-crossing families

Todor Antić, Martin Balko, Birgit Vogtenhuber

For a finite set $P$ of points in the plane in general position, a \emph{crossing family} of size $k$ in $P$ is a collection of $k$ line segments with endpoints in $P$ that are pai…

cs.CG2025

Characterizing and Recognizing Twistedness

Oswin Aichholzer, Alfredo García, Javier Tejel +2

In a simple drawing of a graph, any two edges intersect in at most one point (either a common endpoint or a proper crossing). A simple drawing is generalized twisted if it fulfills…

cs.CG2025

Constrained Flips in Plane Spanning Trees

Oswin Aichholzer, Joseph Dorfer, Birgit Vogtenhuber

A flip in a plane spanning tree $T$ is the operation of removing one edge from $T$ and adding another edge such that the resulting structure is again a plane spanning tree. For tre…

cs.CG2025

On the geometric $k$ -colored crossing number of $K_{n}$

Benedikt Hahn, Bettina Klinz, Birgit Vogtenhuber

We study the \emph{geometric $k$ -colored crossing number} of complete graphs $cr_{k} (K_{n})$ , which is the smallest number of monochromatic crossings in an…

Monotonically Decreasing the Number of Directed 3-Cycles via Edge-Flips?

Crossing and non-crossing families

Characterizing and Recognizing Twistedness

Constrained Flips in Plane Spanning Trees

On the geometric k-colored crossing number of Kn​

On the geometric $k$ -colored crossing number of $K_{n}$