A simple bijection between binary trees and colored ternary trees.
Sun, Yidong (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “Bijective proofs of identities from colored binary trees.”
A simple bijection between binary trees and colored ternary 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:
A combinatorial derivation of the number of labeled forests.
Callan, David (2003)
Journal of Integer Sequences [electronic only]
Similarity:
Bijective counting of tree-rooted maps and shuffles of parenthesis systems.
Bernardi, Olivier (2007)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
On the rules for the elimination of the non-canonical Morgan trees
Damir Vukičević (2009)
Kragujevac Journal of Mathematics
Similarity:
Distances between rooted trees
Bohdan Zelinka (1991)
Mathematica Bohemica
Similarity:
Two types of a distance between isomorphism classes of graphs are adapted for rooted trees.
Probabilistic proofs of hook length formulas involving trees.
Sagan, Bruce E. (2009)
Séminaire Lotharingien de Combinatoire [electronic only]
Similarity: