activity
20122026
most citedOn Gallai's conjecture for series-parallel graphs and planar 3-trees

2 citations · 4 across the 12 of their papers we have counts for

collaborators
Showing 2018Show all

2 papers · 1 filter

cs.CG2018

Drawing Subcubic 1-Planar Graphs with Few Bends, Few Slopes, and Large Angles

Philipp Kindermann, Fabrizio Montecchiani, Lena Schlipf +1

We show that the 1-planar slope number of 3-connected cubic 1-planar graphs is at most 4 when edges are drawn as polygonal curves with at most 1 bend each. This bound is obtained b…

cs.CG2018

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…