A coding algorithm for Rényi trees

DOI10.1016/0097-3165(93)90021-YzbMath0773.05039MaRDI QIDQ1207762

William Y. C. Chen

Publication date: 23 May 1993

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

zbMATH Keywords

sequencesbijection\(k\)-treesRényi trees

Mathematics Subject Classification ID

Trees (05C05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (5)

Counting and enumerating unlabeled split–indifference graphs ⋮ Bijective linear time coding and decoding for \(k\)-trees ⋮ A clique-difference encoding scheme for labelled \(k\)-path graphs ⋮ Enumeration of labelled \((k,m)\)-trees ⋮ The Reduced Prüfer Code for Rooted Labelled k-Trees

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Cayley's formula for multidimensional trees
• On simple characterizations of k-trees
• Enumerating k-trees
• A general bijective algorithm for trees.
• Onq-trees
• On acyclic simplicial complexes
• The number of labeled k-dimensional trees
• On the number of labeled 2-trees
• The number of labeled k-trees

This page was built for publication: A coding algorithm for Rényi trees