2 citations · 3 across the 3 of their papers we have counts for
3 papers · 1 filter
Augmenting Geometric Graphs with Matchings
Alexander Pilz, Jonathan Rollin, Lena Schlipf +1
We study noncrossing geometric graphs and their disjoint compatible geometric matchings. Given a cycle (a polygon) P we want to draw a set of pairwise disjoint straight-line edges…
The Number of Convex Polyominoes with Given Height and Width
Kevin Buchin, Man-Kwun Chiu, Stefan Felsner +2
We give a new combinatorial proof for the number of convex polyominoes whose minimum enclosing rectangle has given dimensions. We also count the subclass of these polyominoes that…
On Gallai's conjecture for series-parallel graphs and planar 3-trees
Philipp Kindermann, Lena Schlipf, André Schulz
A path cover is a decomposition of the edges of a graph into edge-disjoint simple paths. Gallai conjectured that every connected -vertex graph has a path cover with at most $\lc…