Tree codes that preserve increases and degree sequences

@article{Kreweras1991TreeCT,
  title={Tree codes that preserve increases and degree sequences},
  author={Germain Kreweras and Paul Moszkowski},
  journal={Discrete Mathematics},
  year={1991},
  volume={87},
  pages={291-296}
}
Kreweras, G. and P. Moszkowski, Tree codes that preserve increases and degree sequences, Discrete Mathematics 87 (1991) 291-296. We define a bijection from the set .Y,, of rooted Cayley’s trees with n vertices to the set [l, n]“-’ of words of n 1 letters written with the alphabet [l, n]. This code has three remarkable properties: (1) As in Priifer’s code [l… CONTINUE READING