Abstract
Let be the set of -ary labeled trees on . A maximal decreasing subtree of an -ary labeled tree is defined by the maximal -ary subtree from the root with all edges being decreasing. In this paper, we study a new refinement of , which is the set of -ary labeled trees whose maximal decreasing subtree has vertices.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.