1. Circuits and trees in oriented linear graphs;van Aardenne-Ehrenfest;Simon Stevin: Wis- en Natuurkd. Tijdschr.,1951
2. Reverse search for enumeration;Avis;Discrete Appl. Math.,1996
3. Optimal listing of cycles and st-paths in undirected graphs;Birmelé,2012
4. Counting Eulerian circuits is #p-complete;Brightwell,2005
5. Finding double Euler trails of planar graphs in linear time;Chen;SIAM J. Comput.,2002