A Fourier inversion formula for evolutionary trees. The Wiener index of trees from certain families. The combinatorics of reconstructing evolutionary trees. The complexity of the bottleneck graph bipartition problem. Integral uniform concurrent flows and all pairs packet routing.
Subdivision thresholds for two classes of graphs.
Counting bichromatic evolutionary trees. An inequality for degree sequences. Applications of antilexicographic order. I. An enumerative theory of trees. On the distribution of lengths of evolutionary trees.