Note: The problem assumes the graph is connected. If the graph is not connected, we may learn that fact easily in polynomial time. Thus this problem easily extends to a polynomial time decision procedure for Euler tours in arbitrary graphs. Conclusion the Euler Tour problem is in P, in stark contrast to the Hamiltonian cycle problem.