Z3-connectivity with independent number 2
  Let G be a 3-edge-connected graph on n vertices. It is proved in this paper that if the number of independent set no more than 2, then either G can be Z3-contracted to one of graphs {K1;K4} or G is one of the graphs in Fig. 1. 
Fan Yang and Xiangwen Li, and Liangchen Li
math.CO