The Reduced Prüfer Code for Rooted Labelled k-Trees

DOI10.1016/J.ENDM.2005.06.024MaRDI QIDQ3439323zbMATH OpenOpenAlexFDO

Authors P. R. C. Pereira, O. Vernet, Lilian Markenzon

Publication date 29 May 2007

Published in Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.endm.2005.06.024

zbMATH Keywords

codewordsk-treesPrüfer code

Mathematics Subject Classification ID

Trees (05C05) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Combinatorial codes (94B25)

Recommendations

• scientific article; zbMATH DE number 1735659
• A Bijective Code for k-Trees with Linear Time Encoding and Decoding
• A coding algorithm for Rényi trees
• An efficient algorithm for generating Prüfer codes from labelled trees
• Bijective linear time coding and decoding for \(k\)-trees

Cites work

• scientific article; zbMATH DE number 3859178 (Why is no real title available?)
• scientific article; zbMATH DE number 3710197 (Why is no real title available?)
• scientific article; zbMATH DE number 1735659 (Why is no real title available?)
• scientific article; zbMATH DE number 3329638 (Why is no real title available?)
• A coding algorithm for Rényi trees
• On acyclic simplicial complexes
• On simple characterizations of k-trees

Cited in

(9)

• A Bijective Code for k-Trees with Linear Time Encoding and Decoding
• Bijective linear time coding and decoding for \(k\)-trees
• A coding algorithm for Rényi trees
• Colored Prüfer codes for k-edge colored trees
• Counting and enumerating unlabeled split-indifference graphs
• Efficient Prüfer-Like Coding and Counting Labelled Hypertrees
• On the number of labeled k-arch graphs
• A clique-difference encoding scheme for labelled \(k\)-path graphs
• Efficient Prüfer-like coding and counting labelled hypertrees

This page was built for publication: The Reduced Prüfer Code for Rooted Labelled k-Trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3439323)