A note on Prüfer-like coding and counting forests of uniform hypertrees

Christian Lavault

This note presents an encoding and a decoding algorithms for a forest of (labelled) rooted uniform hypertrees and hypercycles in linear time, by using as few as $n-2$ integers in…