Eulerian and Hamiltonian Graphs · Hard problem

A $3\times4$ grid graph has $12$ vertices (rows of $4$) joined to their horizontal and vertical neighbours. How many vertices have odd degree?