| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 9514541 | Electronic Notes in Discrete Mathematics | 2005 | 5 Pages |
Abstract
Based on the redundant Prüfer code for k-trees, developed by Rényi and Rényi, a more compact new encoding scheme is proposed and the one-to-one correspondence between both codes is proved.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
P.R. Costa Pereira, L. Markenzon, O. Vernet,