Determine whether the following assertion is true or false; if it is true then prove it, and if it is false then give a counterexample:

If a graph contains a cycle that includes all the edges, the cycle is an Euler cycle.