In graphs, in which all vertices have an odd degree, the number of Hamiltonian cycles through any fixed edge is always even.
(a) true
(b) false
This question was posed to me in an online quiz.
The origin of the question is Checksum, Complexity Classes & NP Complete Problems in portion Checksum, Complexity Classes & NP Complete Problems of Data Structures & Algorithms II