28 citations · 110 across the 30 of their papers we have counts for
Showing 2017 · math.COShow all
2 papers · 2 filters
math.CO2017★ 9 cited
Lower bounds on the number of realizations of rigid graphs
Georg Grasegger, Christoph Koutschan, Elias Tsigaridas
Computing the number of realizations of a minimally rigid graph is a notoriously difficult problem. Towards this goal, for graphs that are minimally rigid in the plane, we take adv…
math.CO2017★ 14 cited
Graphs with Flexible Labelings
Georg Grasegger, Jan Legerský, Josef Schicho
For a flexible labeling of a graph, it is possible to construct infinitely many non-equivalent realizations keeping the distances of connected points constant. We give a combinator…