Graphs with Flexible Labelings

Abstract

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 combinatorial characterization of graphs that have flexible labelings. The characterization is based on colorings of the edges with restrictions on the cycles. Furthermore, we give necessary criteria and sufficient ones for the existence of such colorings.

Cited by in corpus (8)

• Graphs with Flexible Labelings allowing Injective Realizations
• On the existence of paradoxical motions of generically rigid graphs on the sphere
• FlexRiLoG -- A SageMath Package for Motions of Graphs
• Flexing infinite frameworks with applications to braced Penrose tilings
• Zero-sum cycles in flexible polyhedra
• Flexible placements of graphs with rotational symmetry
• Flexibility and rigidity of frameworks consisting of triangles and parallelograms
• Flexible placements of periodic graphs in the plane