Hi, help me prove that a 3-regular graph has two Hamiltonian circuits if it has one. (3-regular graph means each point is connected to 3 other points. A Hamiltonian circuit means one can make a return trip to a point after having visited every other point exactly once.)