1. Circuits and Trees in Oriented Linear Graphs;van Aardenne-Ehrenfest;Simon Stevin,1951
2. An Algorithm for Finding Euler Circuits in Complete Graphs of Prime Order;Abramson,1967
3. J.Abrham, A.Kotzig On the missing value in a graceful numbering of a 2-regular graph Proc. of the Nineteenth Southeastern Conference on Combinatorics, Graph Theory, and Computing. 1988, Baton Rouge, LA, 261–266 1988. Congr. Numer. 65
4. Minimal Identities for Algebras;Amitsur;Proc. Amer. Math. Soc.,1950
5. An Upper Bound on the Length of a Hamiltonian Walk of a Maximal Planar Graph;Asano;J. Graph Theory,1980