A general bijective algorithm for increasing trees

MaRDI QIDQ2721872zbMATH OpenFDO

Authors William Y. C. Chen

Publication date 11 July 2001

Published in Systems Science and Mathematical Sciences (Search for Journal in Brave)

zbMATH Keywords

decomposition algorithmenumeration of plane treesincreasing treesSchröder trees

Mathematics Subject Classification ID

Trees (05C05) Enumeration in graph theory (05C30) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• A general bijective algorithm for trees.
• An involution on increasing trees
• A bijection of plane increasing trees with relaxed binary trees of right height at most one
• A decomposition algorithm for noncrossing trees
• Two bijections on weakly increasing trees

Cited in

(13)

• The pessimistic search and the straightening involution for trees
• A bijection of plane increasing trees with relaxed binary trees of right height at most one
• Two bijections on weakly increasing trees
• An involution on increasing trees
• Increasing forests and quadrangulations via a bijective approach
• A general bijective algorithm for trees.
• Increasing trees and alternating permutations
• More bijective combinatorics of weakly increasing trees
• On Ward numbers and increasing Schröder trees
• New refinements of Narayana polynomials and Motzkin polynomials
• \((k,m)\)-Catalan numbers and hook length polynomials for plane trees
• Bell polynomials and k-generalized Dyck paths
• Staircase tilings and \(k\)-Catalan structures

This page was built for publication: A general bijective algorithm for increasing trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2721872)