  It is a famous result of Lovasz and Yemini (1982) that 6-connected graphs are
rigid in the plane. This was recently improved by Jackson and Jordan (2009) who
showed that 6-mixed connectivity is also sufficient for rigidity. Here we give
sufficient graph connectivity conditions for both `forced symmetric' and
`incidentally symmetric' infinitesimal rigidity in the plane.
