AbstractThe subject of each of the five sections of this paper is the planted plane trees discussed by Harary, Prins, and Tutte [7]. A description of the content of the present work is given in Section 1. Section 2 is devoted to a definition of plane trees in terms of finite sets and relations defined on them—we hope this definition will replace the topological concepts introduced in [7]. A one-to-one correspondence between the classes of isomorphic planted plane trees with n+2 vertices and the classes of isomorphic 3-valent planted plane trees with 2n+2 vertices is given in Section 3. Sections 4 and 5 deal with enumeration problems
This thesis solves an enumeration problem for sequences of complete n-ary trees. Given the sequence ...
Abstract. We introduce the notion of doubly rooted plane trees and give a de-composition of these tr...
The rotation correspondence is a map that sends the set of plane trees onto the set of binary trees....
AbstractThe subject of each of the five sections of this paper is the planted plane trees discussed ...
AbstractUsing the definition of planted plane trees given by D. A. Klarner (“A correspondence betwee...
AbstractUsing the definition of planted plane trees given by D. A. Klarner (“A correspondence betwee...
AbstractThis paper sets into relation three different classes of trees: (i) mod r-valent planted pla...
AbstractThe correspondence of certain plane trees and binary sequences reported by D. A. Klarner in ...
AbstractThe paper gives three different ways of producing the one-to-one correspondence between plan...
AbstractThe correspondence of certain plane trees and binary sequences reported by D. A. Klarner in ...
AbstractTutte's result for the number of planted plane trees with a given degree partition is rederi...
AbstractOver all plane trees with n edges, the total number of vertices with odd degree is twice the...
Abstract. We show that the class of finite rooted binary plane trees is a Ramsey class (with respect...
AbstractTutte's result for the number of planted plane trees with a given degree partition is rederi...
AbstractWe introduce the notion of doubly rooted plane trees and give a decomposition of these trees...
This thesis solves an enumeration problem for sequences of complete n-ary trees. Given the sequence ...
Abstract. We introduce the notion of doubly rooted plane trees and give a de-composition of these tr...
The rotation correspondence is a map that sends the set of plane trees onto the set of binary trees....
AbstractThe subject of each of the five sections of this paper is the planted plane trees discussed ...
AbstractUsing the definition of planted plane trees given by D. A. Klarner (“A correspondence betwee...
AbstractUsing the definition of planted plane trees given by D. A. Klarner (“A correspondence betwee...
AbstractThis paper sets into relation three different classes of trees: (i) mod r-valent planted pla...
AbstractThe correspondence of certain plane trees and binary sequences reported by D. A. Klarner in ...
AbstractThe paper gives three different ways of producing the one-to-one correspondence between plan...
AbstractThe correspondence of certain plane trees and binary sequences reported by D. A. Klarner in ...
AbstractTutte's result for the number of planted plane trees with a given degree partition is rederi...
AbstractOver all plane trees with n edges, the total number of vertices with odd degree is twice the...
Abstract. We show that the class of finite rooted binary plane trees is a Ramsey class (with respect...
AbstractTutte's result for the number of planted plane trees with a given degree partition is rederi...
AbstractWe introduce the notion of doubly rooted plane trees and give a decomposition of these trees...
This thesis solves an enumeration problem for sequences of complete n-ary trees. Given the sequence ...
Abstract. We introduce the notion of doubly rooted plane trees and give a de-composition of these tr...
The rotation correspondence is a map that sends the set of plane trees onto the set of binary trees....