AbstractA bijection between binary trees, with nodes labelled black or white, and a black node never having a white right child, and ternary trees is given. It is simpler than another bijection that has recently appeared in this journal
A bijection is defined recursively between the set of natural numbers and the set of finite rooted t...
AbstractLeaf-colored binary trees, with an induced integer "length," arise in biomathematics. We ana...
Abstract. Weexamine the reversemathematics and computability theory of a formofRamsey’s theorem in w...
AbstractA 2-binary tree is a binary rooted tree whose root is colored black and the other vertices a...
AbstractA 2-binary tree is a binary rooted tree whose root is colored black and the other vertices a...
AbstractThe number Nn of non-crossing trees of size n satisfies Nn+1=Tn where Tn enumerates ternary ...
AbstractRecently, Gu et al. [N.S.S. Gu, N.Y. Li, T. Mansour, 2-Binary trees: Bijections and related ...
AbstractAccording to the Fibonacci number which is studied by Prodinger et al., we introduce the 2-p...
AbstractA bijection is introduced between ordered trees and bicoloured ordered trees, which maps lea...
AbstractIn accordance with the principle from other branches of mathematics that it is better to exh...
In this thesis, we use Mathematical Induction to give a direct proof to show the numbers of binary t...
AbstractThe number Nn of non-crossing trees of size n satisfies Nn+1=Tn where Tn enumerates ternary ...
Abstract. This paper considers the enumeration of trees avoiding a contigu-ous pattern. We provide a...
AbstractThe distribution of binary trees with bicoloured endpoints under the taxonomic principle of ...
AbstractIn this paper, we illustrate a bijective proof of the enumerative formula regarding non-sepa...
A bijection is defined recursively between the set of natural numbers and the set of finite rooted t...
AbstractLeaf-colored binary trees, with an induced integer "length," arise in biomathematics. We ana...
Abstract. Weexamine the reversemathematics and computability theory of a formofRamsey’s theorem in w...
AbstractA 2-binary tree is a binary rooted tree whose root is colored black and the other vertices a...
AbstractA 2-binary tree is a binary rooted tree whose root is colored black and the other vertices a...
AbstractThe number Nn of non-crossing trees of size n satisfies Nn+1=Tn where Tn enumerates ternary ...
AbstractRecently, Gu et al. [N.S.S. Gu, N.Y. Li, T. Mansour, 2-Binary trees: Bijections and related ...
AbstractAccording to the Fibonacci number which is studied by Prodinger et al., we introduce the 2-p...
AbstractA bijection is introduced between ordered trees and bicoloured ordered trees, which maps lea...
AbstractIn accordance with the principle from other branches of mathematics that it is better to exh...
In this thesis, we use Mathematical Induction to give a direct proof to show the numbers of binary t...
AbstractThe number Nn of non-crossing trees of size n satisfies Nn+1=Tn where Tn enumerates ternary ...
Abstract. This paper considers the enumeration of trees avoiding a contigu-ous pattern. We provide a...
AbstractThe distribution of binary trees with bicoloured endpoints under the taxonomic principle of ...
AbstractIn this paper, we illustrate a bijective proof of the enumerative formula regarding non-sepa...
A bijection is defined recursively between the set of natural numbers and the set of finite rooted t...
AbstractLeaf-colored binary trees, with an induced integer "length," arise in biomathematics. We ana...
Abstract. Weexamine the reversemathematics and computability theory of a formofRamsey’s theorem in w...
DOI
Add to ORKG