Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference11 articles.
1. On the distribution of lengths of evolutionary trees;Carter;SIAM, J. Discrete Math.,1990
2. Application of antilexicographic order I. An enumerative theory of trees;Erdős;Adv. in Appl. Math.,1989
3. Mutual Choices;Göbel,1963
4. A theorem of finite sets;Katona,1966
5. The Art of Computer Programming I: Fundamental Algorithms;Knuth,1973
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Labellable Phylogenetic Networks;Bulletin of Mathematical Biology;2023-04-25
2. Brauer and partition diagram models for phylogenetic trees and forests;Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences;2022-06
3. Counting and enumerating galled networks;Discrete Applied Mathematics;2020-09
4. Core forging and local limit theorems for the k-core of random graphs;Journal of Combinatorial Theory, Series B;2019-07
5. Spanning forests of a digraph and their applications;Automation and Remote Control;2001