Another Enumeration of Trees
From MaRDI portal
Cited in
(14)- Preuves combinatoires des identites d'Abel
- Counting quiver representations over finite fields via graph enumeration.
- A blossoming algorithm for tree volumes of composite digraphs
- A program for computing identity-kernels from certain directed graphs
- Two bijective proofs for the arborescent form of the Good-Lagrange formula and some applications to colored rooted trees and cacti
- On the asymptotic behavior of the independence number of a random (n,n)-tree
- Preuves combinatoires des identites d'Abel
- A conjecture of E. D. Bolker
- Primal transportation and transshipment algorithms
- Forest volume decompositions and Abel-Cayley-Hurwitz multinomial expansions
- Colouring Random Empire Trees
- Matchings in superpositions of (n, n)‐bipartite trees
- Gibbs' Measures on Combinatorial Objects and the Central Limit Theorem for an Exponential Family of Random Trees
- Counting trees using symmetries
This page was built for publication: Another Enumeration of Trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5563936)