Parity reversing involutions on plane trees and 2-Motzkin paths

The problem of counting plane trees with n edges and an even or an odd number of leaves has been recently studied by Eu, Liu and Yeh, in connection with an identity on coloring nets due to Stanley. This identity was also obtained by Bonin, Shapiro and Simion in their study of Schr

• Type: Journal
• Year: 2006
• Where: EJC
• Authors: William Y. C. Chen, Louis W. Shapiro, Laura L. M. Yang
• Keywords: EJC 2006, EJC 2007, Lagrange Inversion Formula, Odd Number, Plane Trees