The Reduced Prüfer Code for Rooted Labelled k-Trees

Based on the redundant Prüfer code for k-trees, developed by Rényi and Rényi, a more compact new encoding scheme is proposed and the one-to-one correspondence between both codes is proved.