On the Number of Distinct Forests
From MaRDI portal
Publication:3201087
DOI10.1137/0403050zbMath0715.05035OpenAlexW2047572897MaRDI QIDQ3201087
Publication date: 1990
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0403050
Trees (05C05) Exact enumeration problems, generating functions (05A15) Enumeration in graph theory (05C30) Asymptotic enumeration (05A16)
Related Items
The number of rooted forests in circulant graphs, Enumeration of noncrossing trees on a circle, Counting rooted spanning forests for circulant foliation over a graph, Combinatorial explanation of the weighted Laplacian characteristic polynomial of a graph and applications, On the Jacobian group of a cone over a circulant graph, Cyclic coverings of graphs. Counting rooted spanning forests and trees, Kirchhoff index, and Jacobians, Perfect sampling methods for random forests, The Potts model and the Tutte polynomial, On the number of labeled graphs of bounded treewidth, Counting rooted spanning forests in cobordism of two circulant graphs, Bounds on the chromatic polynomial and on the number of acyclic orientations of a graph, Counting acyclic hypergraphs