A bijection from ordered trees to binary trees that sends the pruning order to the Strahler number
type: Item
instance of: scholarly article
title: A bijection from ordered trees to binary trees that sends the pruning order to the Strahler number
zbMATH Open document ID: 0701.05018
DOI: 10.1016/0012-365X(90)90047-L
author: Doron Zeilberger
published in: Discrete Mathematics
publication date: 1990-01-01T00:00:00Z
review text: In this beautiful note a bijective proof for the following fact is given: The number of ordered trees with n vertices and pruning order k equals the number of binary trees with n leaves and Strahler number k.
reviewed by: Peter Kirschenhofer
Mathematics Subject Classification ID: 05C05
Mathematics Subject Classification ID: 05C30
zbMATH DE Number: 4148112
zbMATH Keywords: number of ordered trees
MaRDI profile type: Publication
cites work: Q3748279
cites work: Q3726126
cites work: Q3703700
Recommended article: A bijection on ordered trees and its consequences
Recommended article: A bijection between ordered trees and bicoloured ordered trees
Recommended article: On the generation of binary trees inA-order
Recommended article: A simple bijection between a subclass of 2-binary trees and ternary trees
Recommended article: A one-to-one correspondence between two classes of ordered trees
Recommended article: A bijective enumeration of labeled trees with given indegree sequence
Recommended article: A simple bijection between binary trees and colored ternary trees
Recommended article: A bijective enumeration of tiered trees
Recommended article: Horton-Strahler ordering of random binary trees
Recommended article: Deux propriétés des arbres binaires ordonnés stricts. (Two properties of strictly ordered binary trees)
description: scientific article; zbMATH DE number 4148112