Citations of

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

  1. S. Caminiti, On Coding Labeled Trees, PhD Thesis, Sapienza University of Rome, Academic Year 2006/2007.

  2. S. Caminiti, E.G. Fusco, and R. Petreschi. Bijective Linear Time Coding and Decoding for k-Trees. Theory Comput Syst (2010) 46: 284¨C300.

  3. P.R.C. Pereira, L. Markenzon and O. Vernet, A compact code for k-trees. Pesqui. Oper. [online]. 2009, vol.29, n.3, pp. 493-502. ISSN 0101-7438.

  4. P.R.C. Pereira, L. Markenzon and O. Vernet, The reduced Pr¨¹fer code for rooted labelled k-trees, Electronic Notes in Discrete Mathematics 22 (2005), pp. 135¨C139.

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

  6. O. Pikhurko, Enumeration of labelled (k,m)-trees, J. Combin. Theory Ser. A, 86 (1999) 197-199.

  7. O. Pikhurko, Foata¡¯s bijection for tree-Like structures, arXiv:math.CO/0007148, 2000.

back to homepage