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…