Enumeration results for alternating tree families

We study two enumeration problems for up-down alternating trees, i.e., rooted labelled trees T, where the labels v1, v2, v3, . . . on every path starting at the root of T satisfy v1 < v2 > v3 < v4 >

• Type: Journal
• Year: 2010
• Where: EJC
• Authors: Markus Kuba, Alois Panholzer
• Keywords: EJC 2007, EJC 2010, Root Node, Up-down Alternating Trees, Various Tree Families