The following pages link to Another Enumeration of Trees (Q5563936):
Displaying 14 items.
- Counting quiver representations over finite fields via graph enumeration. (Q734796) (← links)
- A conjecture of E. D. Bolker (Q1156135) (← links)
- A blossoming algorithm for tree volumes of composite digraphs (Q1415380) (← links)
- Forest volume decompositions and Abel-Cayley-Hurwitz multinomial expansions (Q1601429) (← links)
- Two bijective proofs for the arborescent form of the Good-Lagrange formula and some applications to colored rooted trees and cacti (Q1885017) (← links)
- On the asymptotic behavior of the independence number of a random \((n,n)\)-tree (Q1911235) (← links)
- Counting trees using symmetries (Q2434888) (← links)
- Gibbs' Measures on Combinatorial Objects and the Central Limit Theorem for an Exponential Family of Random Trees (Q3415827) (← links)
- Colouring Random Empire Trees (Q3599154) (← links)
- Primal transportation and transshipment algorithms (Q3863694) (← links)
- Matchings in superpositions of (<i>n, n</i>)‐bipartite trees (Q4288892) (← links)
- A program for computing identity-kernels from certain directed graphs (Q5636295) (← links)
- Preuves combinatoires des identites d'Abel (Q5906930) (← links)
- Preuves combinatoires des identites d'Abel (Q5967091) (← links)
