Four-regular graphs with extremal rigidity properties (Q6197698): Difference between revisions

@@ Property / cites work @@
+A proof of Connelly's conjecture on 3-connected circuits of the rigidity matroid.
+Normal rank
@@ Property / cites work @@
+Compatible circuit decompositions of 4‐regular graphs
+Normal rank
@@ Property / cites work @@
+Conditions for Unique Graph Realizations
@@ Property / cites work: Conditions for Unique Graph Realizations / rank @@
+Normal rank
@@ Property / cites work @@
+Connected rigidity matroids and unique realizations of graphs
+Normal rank
@@ Property / cites work @@
+The 2-dimensional rigidity of certain families of graphs
+Normal rank
@@ Property / cites work @@
+Q2990097
@@ Property / cites work: Q2990097 / rank @@
+Normal rank
@@ Property / cites work @@
+Minimum size highly redundantly rigid graphs in the plane
+Normal rank
@@ Property / cites work @@
+Balanced generic circuits without long paths
@@ Property / cites work: Balanced generic circuits without long paths / rank @@
+Normal rank
@@ Property / cites work @@
+On graphs and rigidity of plane skeletal structures
+Normal rank
@@ Property / cites work @@
+On the robustness to multiple agent losses in 2D and 3D formations
+Normal rank
@@ Property / cites work @@
+Birigidity in the Plane
@@ Property / cites work: Birigidity in the Plane / rank @@
+Normal rank
@@ Property / cites work @@
+Addressing agent loss in vehicle formations and sensor networks
+Normal rank