Some combinatorial problems on ordered trees
From MaRDI portal
Publication:1065013
zbMATH Open0576.05016MaRDI QIDQ1065013FDOQ1065013
Authors: Zheng Yu Wang
Publication date: 1983
Published in: Chinese Annals of Mathematics. Series B (Search for Journal in Brave)
Recommendations
Cited In (16)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Zebra trees
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the average height of \(b\)-balanced ordered trees
- Title not available (Why is that?)
- The combinatorics of even trees
- Title not available (Why is that?)
- On the number of deepest nodes in ordered trees
- The combinatorics of discrete time-trees: theory and open problems
- Deepest nodes in marked ordered trees
- The oldest child tree
- Skew diagrams and ordered trees
- On the average number of nodes covering a given number of leaves in an unordered binary tree
- Ordered Forests, Permutations, and Iterated Integrals
This page was built for publication: Some combinatorial problems on ordered trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1065013)