Planarizing gadgets do not exist for the recognition problem of (k, l)-tight graphs.
Pebble game algorithms and sparse graphs
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
verdicts
UNVERDICTED 2representative citing papers
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.
citing papers explorer
-
Planarizing Gadgets for (k, l)-tight Graphs Do Not Exist
Planarizing gadgets do not exist for the recognition problem of (k, l)-tight graphs.
-
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.