We construct an infinite family {Cay? (????????; ????????; ????????)} of connected graphs that do not have Hamiltonian circuits, such that the orders of the generators ???? ????  and ???? ???? are unbounded. We also prove that if ???? is any finite graph with |[????, ????] | ? 3, then every connected graph on ???? has a Hamiltonian circuit.