✦ LIBER ✦

A generalized enumeration of labeled trees and reverse Prüfer algorithm

✍ Scribed by Seunghyun Seo; Heesung Shin

Book ID: 108167215
Publisher: Elsevier Science
Year: 2007
Tongue: English
Weight: 126 KB
Volume: 114
Category: Article
ISSN: 0097-3165
DOI: 10.1016/j.jcta.2007.01.010

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An Efficient Algorithm for Generating Pr

An Efficient Algorithm for Generating Prüfer Codes from Labelled Trees

✍ H. -C. Chen; Y. -L. Wang 📂 Article 📅 2000 🏛 Springer 🌐 English ⚖ 87 KB

Exact Enumeration of 1342-Avoiding Permu

Exact Enumeration of 1342-Avoiding Permutations: A Close Link with Labeled Trees and Planar Maps

✍ Miklós Bóna 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 318 KB

Solving the first nonmonotonic, longer-than-three instance of a classic enumeration problem, we obtain the generating function H(x) of all 1342-avoiding permutations of length n as well as an exact formula for their number S n (1342). While achieving this, we bijectively prove that the number of ind