37 citations · 170 across the 24 of their papers we have counts for
Showing 2009Show all
3 papers · 1 filter
math.CO2009★ 3 cited
On the number of spanning trees a planar graph can have
Kevin Buchin, André Schulz
We prove that any planar graph on vertices has less than spanning trees. Under the restriction that the planar graph is 3-connected and contains no triangle and…
cs.CG2009★ 17 cited
Small grid embeddings of 3-polytopes
Ares Ribó Mor, Günter Rote, André Schulz
We introduce an algorithm that embeds a given 3-connected planar graph as a convex 3-polytope with integer coordinates. The size of the coordinates is bounded by $O(2^{7.55n})=O(18…
math.CO2009★ 6 cited
Flip Graphs of Degree-Bounded (Pseudo-)Triangulations
Oswin Aichholzer, Thomas Hackl, David Orden +4
We study flip graphs of triangulations whose maximum vertex degree is bounded by a constant . In particular, we consider triangulations of sets of points in convex position…