Prüfer codes on vertex-colored rooted trees

R. W. R. Darling, Grant Fickes

Prüfer codes provide an encoding scheme for representing a vertex-labeled tree on $n$ vertices with a string of length $n-2$. Indeed, two labeled trees are isomorphic if and only…