1. H. Prufer, “Neuer Beweis cines Satzesuber Permutationen,” Archiv fur Mathematik und Physik, Vol. 27, 142–144 (1918).
2. N. Deo and P. Micikevičius, “Prufer-like codes for labeled trees,” Congressus Numerantium, Vol. 151, 65–73 (2001).
3. N. Deo and P. Micikevičius, “A new encoding for labeled trees employing a stack and a queue,” Bulletin of the Institute of Combinatorics and its Applications, Vol. 34, 77–85 (2002).
4. E. N. Neville, “The codifying of tree structures,” in: Proc. Cambridge Philosophical Society, Vol. 49, 381–385 (1953).
5. D. W. Matula, “A natural root tree enumeration by prime factorization,” SIAM Review, Vol. 10, 273 (1968).