Q. In graphs, in which all vertices have an odd degree, the number of Hamiltonian cycles through any fixed edge is always even. (Solved)