Generating the alternating group by cyclic triples

It is shown that a collection of circular permutations of length three on an n-set generates the alternating group A_n if and only if the associated graph is connected. It follows that $\text{1}\text{2}\text{n}$] circular permutations of length three may generateA_n.