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.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Sun, Yidong (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Seo, Seunghyun (2005)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Lang, Wolfdieter (2009)
Journal of Integer Sequences [electronic only]
Similarity:
Singer, Dan (2001)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Zoran Stanić (2006)
Publications de l'Institut Mathématique
Similarity:
Callan, David (2003)
Journal of Integer Sequences [electronic only]
Similarity:
Bernardi, Olivier (2007)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Damir Vukičević (2009)
Kragujevac Journal of Mathematics
Similarity:
Bohdan Zelinka (1991)
Mathematica Bohemica
Similarity:
Two types of a distance between isomorphism classes of graphs are adapted for rooted trees.
Sagan, Bruce E. (2009)
Séminaire Lotharingien de Combinatoire [electronic only]
Similarity: