Homework Statement
Find (classify) all graphs with n vertices who's Euler's path is the same as their Hamiltonian cycle.
The Attempt at a Solution
I'd say that any regular graphs with a degree greater than n/2 (Dirac's Theorem) with and n divisible by 2 has both and Euler's path and a...
Can I use cyclic rotation in \vec{a} = \vec{b} x \vec{c} and say:
\vec{c} = \vec{a} x \vec{b}
\vec{b} = \vec{c} x \vec{a}
for any vectors \vec{a}, \vec{b} and \vec{c} or only if they are perpendicular to each other?
If it's only a special case: is there a way to express \vec{b} and...