Bijective proofs of identities from colored binary trees.
Yan, Sherry H.F. (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Displaying similar documents to “A simple bijection between binary trees and colored ternary trees.”
Bijective proofs of identities from colored binary trees.
A combinatorial proof of Postnikov's identity and a generalized enumeration of labeled trees.
Seo, Seunghyun (2005)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Combinatorial interpretation of generalized Stirling numbers.
Lang, Wolfdieter (2009)
Journal of Integer Sequences [electronic only]
Similarity:
On Catalan trees and the Jacobian conjecture.
Singer, Dan (2001)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Determination of Large Families and Diameter of Equiseparable Trees
Zoran Stanić (2006)
Publications de l'Institut Mathématique
Similarity:
Bijective counting of tree-rooted maps and shuffles of parenthesis systems.
Bernardi, Olivier (2007)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
A combinatorial derivation of the number of labeled forests.
Callan, David (2003)
Journal of Integer Sequences [electronic only]
Similarity:
Noncrossing trees and noncrossing graphs.
Chen, William Y.C., Yan, Sherry H.F. (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Probabilistic proofs of hook length formulas involving trees.
Sagan, Bruce E. (2009)
Séminaire Lotharingien de Combinatoire [electronic only]
Similarity:
On the rules for the elimination of the non-canonical Morgan trees
Damir Vukičević (2009)
Kragujevac Journal of Mathematics
Similarity: