Four-regular graphs with extremal rigidity properties
From MaRDI portal
Recommendations
Cites work
- A proof of Connelly's conjecture on 3-connected circuits of the rigidity matroid.
- Addressing agent loss in vehicle formations and sensor networks
- Balanced generic circuits without long paths
- Birigidity in the Plane
- Combinatorial rigidity. Graphs and matroids in the theory of rigid frameworks
- Compatible circuit decompositions of 4‐regular graphs
- Conditions for Unique Graph Realizations
- Connected rigidity matroids and unique realizations of graphs
- Minimum size highly redundantly rigid graphs in the plane
- On graphs and rigidity of plane skeletal structures
- On the robustness to multiple agent losses in 2D and 3D formations
- The 2-dimensional rigidity of certain families of graphs
This page was built for publication: Four-regular graphs with extremal rigidity properties
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6197698)