プリューファー列
↑ Prüfer, H. (1918). “Neuer Beweis eines Satzes über Permutationen”. Arch. Math. Phys. 27: 742–744.
↑ Caminiti, S., Finocchi, I., Petreschi, R. (2007). “On coding labeled trees”. Theoretical Computer Science 382(2): 97–108. doi:10.1016/j.tcs.2007.03.009.
↑ Jens Gottlieb; Bryant A. Julstrom; Günther R. Raidl; Franz Rothlauf. (2001). “Prüfer numbers: A poor representation of spanning trees for evolutionary search”. Proceedings of the Genetic and Evolutionary Computation Conference (GECCO-2001): 343–350. オリジナルの2006-09-26時点におけるアーカイブ。. https://web.archive.org/web/20060926171652/http://www.ads.tuwien.ac.at/publications/bib/pdf/gottlieb-01.pdf.