Applications of antilexicographic order. I: An enumerative theory of trees
From MaRDI portal
Publication:757391
DOI10.1016/0196-8858(89)90026-2zbMATH Open0723.05046OpenAlexW2108717224MaRDI QIDQ757391FDOQ757391
László A. Székely, Péter L. Erdős
Publication date: 1989
Published in: Advances in Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0196-8858(89)90026-2
Recommendations
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Extremal problems for finite sets and convex hulls---a survey
- On Cayley's Formula for Counting Trees
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the Distribution of Lengths of Evolutionary Trees
Cited In (12)
- A new bijection on rooted forests
- Exponential formulas for models of complex reflection groups
- Labellable phylogenetic networks
- Nested sets, set partitions and Kirkman-Cayley dissection numbers
- Counting and enumerating tree-child networks and their subclasses
- Schröder parenthesizations and chordates
- The complexity of reconstructing trees from qualitative characters and subtrees
- Counting and enumerating galled networks
- Matchings and phylogenetic trees
- Counting bichromatic evolutionary trees
- Phylogenetic network classes through the lens of expanding covers
- A general bijective algorithm for trees.
This page was built for publication: Applications of antilexicographic order. I: An enumerative theory of trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q757391)
