Add to ORKGWe give a general formula for the number of occurrences of a pattern, or set of patterns, in the class of ordered (plane-planted) trees with a given number of edges. The proof is com-binatorial. Many known enumerations of ordered and binary trees are special cases of this formula. 1
AbstractIn this paper we examine the enumeration of alternating trees. We give a bijective proof of ...
In the count of branches, a branchpoint is defined as a point of degree at least three, and a branch...
We will define the containment of a full ordered binary tree within another binary tree in a non-con...
AbstractWe give a general formula for the number of occurrences of a pattern, or set of patterns, in...
AbstractWe deal with the class Tn of ordered trees with n edges. Several enumeration problems concer...
AbstractTutte's result for the number of planted plane trees with a given degree partition is rederi...
Abstract. Tanglegrams are a special class of graphs appearing in applications concerning cospeciatio...
AbstractUsing the definition of planted plane trees given by D. A. Klarner (“A correspondence betwee...
In graph theory, trees are combinatorial objects usually defined as connected graphs without cycles....
In this paper we compute the distribution of several statistics on the set of rooted ordered trees. ...
AbstractTutte's result for the number of planted plane trees with a given degree partition is rederi...
We consider the enumeration of binary trees avoiding non-contiguous binary tree patterns. We begin b...
AbstractThe analysis of many algorithms concerning trees requires the enumeration of families of nod...
We consider the enumeration of binary trees avoiding non-contiguous binary tree patterns. We begin b...
AbstractOver all plane trees with n edges, the total number of vertices with odd degree is twice the...
AbstractIn this paper we examine the enumeration of alternating trees. We give a bijective proof of ...
In the count of branches, a branchpoint is defined as a point of degree at least three, and a branch...
We will define the containment of a full ordered binary tree within another binary tree in a non-con...
AbstractWe give a general formula for the number of occurrences of a pattern, or set of patterns, in...
AbstractWe deal with the class Tn of ordered trees with n edges. Several enumeration problems concer...
AbstractTutte's result for the number of planted plane trees with a given degree partition is rederi...
Abstract. Tanglegrams are a special class of graphs appearing in applications concerning cospeciatio...
AbstractUsing the definition of planted plane trees given by D. A. Klarner (“A correspondence betwee...
In graph theory, trees are combinatorial objects usually defined as connected graphs without cycles....
In this paper we compute the distribution of several statistics on the set of rooted ordered trees. ...
AbstractTutte's result for the number of planted plane trees with a given degree partition is rederi...
We consider the enumeration of binary trees avoiding non-contiguous binary tree patterns. We begin b...
AbstractThe analysis of many algorithms concerning trees requires the enumeration of families of nod...
We consider the enumeration of binary trees avoiding non-contiguous binary tree patterns. We begin b...
AbstractOver all plane trees with n edges, the total number of vertices with odd degree is twice the...
AbstractIn this paper we examine the enumeration of alternating trees. We give a bijective proof of ...
In the count of branches, a branchpoint is defined as a point of degree at least three, and a branch...
We will define the containment of a full ordered binary tree within another binary tree in a non-con...