Editing Eulerian path (section)

== Bibliography ==
*{{citation
 | last1 = Erdős | first1 = Pál | author1-link = Paul Erdős
 | last2 = Grünwald | first2 = Tibor | author2-link = Tibor Gallai
 | last3 = Weiszfeld | first3 = Endre | author3-link = Andrew Vázsonyi
 | journal = Mat. Fix. Lapok
 | pages = 129–140
 | title = Végtelen gráfok Euler vonalairól
 | trans-title = On Euler lines of infinite graphs
 | language = hu
 | url = https://www.renyi.hu/~p_erdos/1936-11.pdf
 | volume = 43
 | year = 1936}}.  Translated as {{citation
 | last1 = Erdős | first1 = P. | author1-link = Paul Erdős
 | last2 = Grünwald | first2 = T. | author2-link = Tibor Gallai
 | last3 = Vázsonyi | first3 = E.
 | journal = J. Math. Phys.
 | language = de
 | pages = 59–75
 | title = Über Euler-Linien unendlicher Graphen
 |trans-title=On Eulerian lines in infinite graphs
 | url = http://www.renyi.hu/~p_erdos/1938-15.pdf
 | volume = 17
 | issue = 1–4 | year = 1938
 | doi = 10.1002/sapm193817159}}.
* Euler, L., "[http://www.math.dartmouth.edu/~euler/pages/E053.html Solutio problematis ad geometriam situs pertinentis]", ''Comment. Academiae Sci. I. Petropolitanae'' '''8''' (1736), 128–140.
*{{citation
 | last = Hierholzer | first = Carl | author-link = Carl Hierholzer
 | doi = 10.1007/BF01442866
 | issue = 1
 | journal = [[Mathematische Annalen]]
 | pages = 30–32
 | title = Ueber die Möglichkeit, einen Linienzug ohne Wiederholung und ohne Unterbrechung zu umfahren
 | volume = 6
 | year = 1873| s2cid = 119885172 | url = https://zenodo.org/record/1447429
 }}.
* Lucas, E., ''Récréations Mathématiques IV'', Paris, 1921.
* Fleury, "Deux problemes de geometrie de situation", ''Journal de mathematiques elementaires'' (1883), 257–261.
* [[Tatyana Pavlovna Ehrenfest|T. van Aardenne-Ehrenfest]] and [[Nicolaas Govert de Bruijn|N. G. de Bruijn]] (1951) "Circuits and trees in oriented linear graphs", [[Simon Stevin (journal)|Simon Stevin]] 28: 203–217.
*{{Citation|first=Mikkel|last=Thorup|author-link=Mikkel Thorup|year=2000|pages=343–350|doi=10.1145/335305.335345|contribution=Near-optimal {{Sic|hide=y|fully|-}}dynamic graph connectivity|title=Proc. 32nd ACM Symposium on Theory of Computing|title-link=Symposium on Theory of Computing|s2cid=128282}}
* [[W. T. Tutte]] and [[Cedric Smith (statistician)|C. A. B. Smith]] (1941) "On Unicursal Paths in a Network of Degree 4", [[American Mathematical Monthly]] 48: 233–237.