This article may be expanded with text translated from the corresponding article in the German Wikipedia. (December 2009)
Click [show] on the right to read important instructions before translating.
View a machine-translated version of the German article.
Google's machine translation is a useful starting point for translations, but translators must revise errors as necessary and confirm that the translation is accurate, rather than simply copy-pasting machine-translated text into the English Wikipedia.
Do not translate text that appears unreliable or low-quality. If possible, verify the text with references provided in the foreign-language article.
Hierholzer proved that a graph has an Eulerian cycle if and only if it is connected and every vertex has an even degree. This result had been given, without proof, by Leonhard Euler in 1736. Hierholzer apparently explained his proof, just before his premature death in 1871, to a colleague who then arranged for its posthumous publication which appeared in 1873.