Two short proofs of Kemp's identity for rooted plane trees
From MaRDI portal
Publication:802559
DOI10.1016/S0195-6698(84)80040-2zbMath0559.05007OpenAlexW2076979740MaRDI QIDQ802559
Publication date: 1984
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0195-6698(84)80040-2
Trees (05C05) Combinatorial identities, bijective combinatorics (05A19) Enumeration in graph theory (05C30)
Related Items (3)
A one-to-one correspondence between two classes of ordered trees ⋮ On the number of deepest nodes in ordered trees ⋮ Deepest nodes in marked ordered trees
Cites Work
This page was built for publication: Two short proofs of Kemp's identity for rooted plane trees
