Graphs with flexible labelings
From MaRDI portal
Publication:2316799
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.
Recommendations
Cites work
- Combinatorial genericity and minimal rigidity
- Henneberg moves on mechanisms
- scientific article; zbMATH DE number 501471 (Why is no real title available?)
- Lectures on the theory of algebraic functions of one variable
- On graphs and rigidity of plane skeletal structures
- On the flexibility and symmetry of overconstrained mechanisms
- Rigid two-dimensional frameworks with two coincident points
- When does a planar bipartite framework admit a continuous deformation?
Cited in
(21)- Flexible placements of graphs with rotational symmetry
- Flexing infinite frameworks with applications to braced Penrose tilings
- Flexibility and movability in Cayley graphs
- Graphs with flexible labelings allowing injective realizations
- Four-bar linkages, elliptic functions, and flexible polyhedra
- Combinatorics of Bricard's octahedra
- Flexible placements of periodic graphs in the plane
- Global rigidity of (quasi-)injective frameworks on the line
- scientific article; zbMATH DE number 5924441 (Why is no real title available?)
- On the classification of motions of paradoxically movable graphs
- scientific article; zbMATH DE number 5139432 (Why is no real title available?)
- FlexRiLoG -- a SageMath package for motions of graphs
- Bracing frameworks consisting of parallelograms
- On the Existence of Paradoxical Motions of Generically Rigid Graphs on the Sphere
- And yet it moves: paradoxically moving linkages in kinematics
- Deformation of quadrilaterals and addition on elliptic curves
- Zero‐sum cycles in flexible polyhedra
- A tropical approach to rigidity: counting realisations of frameworks
- Extremal decompositions of tropical varieties and relations with rigidity theory
- Constructing reflection-symmetric flexible realisations of graphs
- Stable cuts, NAC-colourings and flexible realisations of graphs
This page was built for publication: Graphs with flexible labelings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2316799)