论文信息 - Egerváry Research Group on Combinatorial Optimization a Sufficient Connectivity Condition for Generic Rigidity in the Plane a Sufficient Connectivity Condition for Generic Rigidity in the Plane

Egerváry Research Group on Combinatorial Optimization a Sufficient Connectivity Condition for Generic Rigidity in the Plane a Sufficient Connectivity Condition for Generic Rigidity in the Plane

A graph G=(V,E) is said to be 6-mixed-connected if G-U-D is connected for all sets U@?V and D@?E which satisfy 2|U|+|D|@?5. In this note we prove that 6-mixed-connected graphs are (redundantly globally) rigid in the plane. This improves on a previous result of Lovasz and Yemini.

Bill Jackson | Tibor Jordán | B. Jackson | T. Jordán

[1] Bill Jackson,et al. Egerváry Research Group on Combinatorial Optimization Connected Rigidity Matroids and Unique Realizations of Graphs Connected Rigidity Matroids and Unique Realizations of Graphs , 2022 .

[2] L. Lovász,et al. On Generic Rigidity in the Plane , 1982 .

[3] Robert Connelly,et al. Generic Global Rigidity , 2005, Discret. Comput. Geom..

[4] Walter Whiteley,et al. Some matroids from discrete applied geometry , 1996 .

[5] Bill Jackson,et al. The 2-dimensional rigidity of certain families of graphs , 2007 .

[6] Katsuhiro Ota,et al. On Minimally (n, )-Connected Graphs , 2000, J. Comb. Theory, Ser. B.

[7] Tibor Jordán,et al. Sparse certificates and removable cycles in l-mixed p-connected graphs , 2005, Oper. Res. Lett..

[8] G. Laman. On graphs and rigidity of plane skeletal structures , 1970 .

[9] Bill Jackson,et al. The 2‐dimensional rigidity of certain families of graphs , 2007, J. Graph Theory.