Four-regular graphs with extremal rigidity properties

DOI10.1016/j.disc.2023.113833MaRDI QIDQ6197698

Kaylee Weatherspoon, Zeyu Zheng, Robin Huang, Henry Simmons, Tibor Jordán

Publication date: 19 February 2024

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

4-regular graphglobally rigid graphrigid graphredundant rigidityessentially 6-edge connected graph

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Rigidity and flexibility of structures (aspects of discrete geometry) (52C25)

Cites Work

• Unnamed Item
• Balanced generic circuits without long paths
• A proof of Connelly's conjecture on 3-connected circuits of the rigidity matroid.
• 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
• Addressing agent loss in vehicle formations and sensor networks
• Birigidity in the Plane
• The 2-dimensional rigidity of certain families of graphs
• On the robustness to multiple agent losses in 2D and 3D formations
• Conditions for Unique Graph Realizations
• Compatible circuit decompositions of 4‐regular graphs

This page was built for publication: Four-regular graphs with extremal rigidity properties