Deux propriétés des arbres binaires ordonnés stricts. (Two properties of strictly ordered binary trees)
From MaRDI portal
Publication:583224
DOI10.1016/S0195-6698(89)80009-5zbMath0692.05022MaRDI QIDQ583224
Publication date: 1989
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Related Items (14)
The Entringer-Poupard matrix sequence ⋮ Tree calculus for bivariate difference equations ⋮ Bijections for Entringer families ⋮ The doubloon polynomial triangle ⋮ Secant tree calculus ⋮ Seidel triangle sequences and Bi-Entringer numbers ⋮ On the roots of the Poupard and Kreweras polynomials ⋮ Bilabelled increasing trees and hook-length formulae ⋮ More bijections for Entringer and Arnold families ⋮ Unnamed Item ⋮ The complete \(\mathbf{cd}\)-index of Boolean lattices ⋮ Combinatorial families of multilabelled increasing trees and hook-length formulas ⋮ Enumerating split-pair arrangements ⋮ Finite difference calculus for alternating permutations
Cites Work
This page was built for publication: Deux propriétés des arbres binaires ordonnés stricts. (Two properties of strictly ordered binary trees)
