Every flexible graph has a stable cut; this implies a characterization of minimally rigid graphs that admit flexible realizations with positive lengths via NAC-colourings.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2024 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Stable cuts, NAC-colourings and flexible realisations of graphs
Every flexible graph has a stable cut; this implies a characterization of minimally rigid graphs that admit flexible realizations with positive lengths via NAC-colourings.