Citations of

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


  1. S. Caminiti, I. Finocchi and R. Petreschi, On coding labeled trees, Theor. Comput. Sci. 382(2007) 97-108.

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

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

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

  5. 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.

  6. 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.

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

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

  9. O. Pikhurko, Foata's Bijection for Tree-Like Structures, arXiv: math/0007148.

back to homepage