✦ LIBER ✦

Enumeration of Equicolorable Trees

✍ Scribed by Pippenger, Nicholas

Book ID: 118197190
Publisher: Society for Industrial and Applied Mathematics
Year: 2001
Tongue: English
Weight: 211 KB
Volume: 14
Category: Article
ISSN: 0895-4801
DOI: 10.1137/s0895480100368463

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Enumeration of Trees

✍ Wing, O. 📂 Article 📅 1963 🏛 Institute of Electrical and Electronics Engineers 🌐 English ⚖ 258 KB

Enumeration of binary trees

✍ Vinnakota Bapiraju; V.V.Bapeswara Rao 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 185 KB

Chemical trees enumeration algorithms

✍ Roberto Aringhieri; Pierre Hansen; Federico Malucelli 📂 Article 📅 2003 🏛 Springer 🌐 English ⚖ 140 KB

Enumeration of trees by inversions

✍ Ira M. Gessel; Bruce E. Sagan; Yeong-Nan Yeh 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 749 KB

## Abstract Mallows and Riordan “The Inversion Enumerator for Labeled Trees,” __Bulletin of the American Mathematics Society__, vol. 74 [1968] pp. 92‐94) first defined the inversion polynomial, __J~n~(q)__ for trees with __n__ vertices and found its generating function. In the present work, we defi

Enumerating k-trees

✍ Dominique Foata 📂 Article 📅 1971 🏛 Elsevier Science 🌐 English ⚖ 256 KB

AMUacL k functtonal dicf~mition of rooted k-trees is given, enabling k-trees with n labeled points m be enumerated without any calculation.

Enumerating Alternating Trees

✍ Cedric Chauve; Serge Dulucq; Andrew Rechnitzer 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 164 KB

In this paper we examine the enumeration of alternating trees. We give a bijective proof of the fact that the number of alternating unrooted trees with n vertices is given by (1Ân2 n&1 ) n k=1 ( n k ) k n&1 , a problem first posed by A. Postnikov (1997, J. Combin. Theory Ser. A 79, 360 366). We also