W.Y.C. Chen,
A coding algorithm for Rényi trees,
J. Combin. Theory Ser. A 63 (1993) 11-25.

Cited by

  1. S. Caminiti, E.G. Fusco and R. Petreschi, A bijective code for k-trees with linear time encoding and decoding, In: Combinatorics, Algorithms, Probabilistic and Experimental Methodologies, 408-420, Springer, 2007.

  2. S. Caminiti, E.G. Fusco and R. Petreschi, Bijective linear time coding and decoding for k-trees, Theory Comput. Syst. 46 (2010) 284-300.

  3. L. Markenzon, O. Vernet and P.R.C. Pereira, A compact code for k-trees, Pesquisa Operacional 29.3 (2009) 493-502.

  4. L. Markenzon, O. Vernet and P.R.C. Pereira, (L, U)-Bounded priority queues and the codification of Rényi k-trees, Preprint.

  5. L. Markenzon and C.F.E.M. Waga, Counting and enumerating unlabeled split-indifference graphs, Discrete Math. Algorithms Appl. 9 (2017) 1750055, 8 pp.

  6. P.R.C. Pereira, L. Markenzon and O. Vernet, The reduced Prüfer code for rooted labelled k-trees, Electron. Notes Discrete Math. 22 (2005) 135-139.

  7. P.R.C. Pereira, L. Markenzon and O. Vernet, A clique-difference encoding scheme for labelled k-path graphs, Discrete Appl. Math. 156 (2008) 3216-3222.

  8. P.R.C. Pereira, L. Markenzon and O. Vernet, Código reduzido de prüfer para k-árvores rotuladas, Preprint.

  9. O. Pikhurko, Enumeration of Labelled (k, m)-Trees, J. Combin. Theory Ser. A 86 (1999) 197-199.

  10. O. Pikhurko, Foata's bijection for tree-like structures, arXiv: math/0007148.