4 papers
Simplifying Non-Simple Fan-Planar Drawings
Boris Klemz, Kristin Knorr, Meghana M. Reddy +1
A drawing of a graph is fan-planar if the edges intersecting a common edge share a vertex on the same side of . More precisely, orienting arbitrarily and the other e…
On the edge-vertex ratio of maximal thrackles
Oswin Aichholzer, Linda Kleist, Boris Klemz +2
A drawing of a graph in the plane is a thrackle if every pair of edges intersects exactly once, either at a common vertex or at a proper crossing. Conway's conjecture states that a…
The Partition Spanning Forest Problem
Philipp Kindermann, Boris Klemz, Ignaz Rutter +2
Given a set of colored points in the plane, we ask if there exists a crossing-free straight-line drawing of a spanning forest, such that every tree in the forest contains exactly t…
Convexity-Increasing Morphs of Planar Graphs
Linda Kleist, Boris Klemz, Anna Lubiw +3
We study the problem of convexifying drawings of planar graphs. Given any planar straight-line drawing of an internally 3-connected graph, we show how to morph the drawing to one w…