Another Enumeration of Trees
From MaRDI portal
Publication:5563936
DOI10.4153/CJM-1968-104-8zbMath0175.21001OpenAlexW2326100434WikidataQ106435185 ScholiaQ106435185MaRDI QIDQ5563936
Publication date: 1968
Published in: Canadian Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.4153/cjm-1968-104-8
Related Items
Two bijective proofs for the arborescent form of the Good-Lagrange formula and some applications to colored rooted trees and cacti, Matchings in superpositions of (n, n)‐bipartite trees, On the asymptotic behavior of the independence number of a random \((n,n)\)-tree, A program for computing identity-kernels from certain directed graphs, Counting trees using symmetries, A conjecture of E. D. Bolker, A blossoming algorithm for tree volumes of composite digraphs, Preuves combinatoires des identites d'Abel, Primal transportation and transshipment algorithms, Colouring Random Empire Trees, Counting quiver representations over finite fields via graph enumeration., Preuves combinatoires des identites d'Abel, Gibbs' Measures on Combinatorial Objects and the Central Limit Theorem for an Exponential Family of Random Trees, Forest volume decompositions and Abel-Cayley-Hurwitz multinomial expansions
