The following pages link to On the Number of Distinct Forests (Q3201087):
Displaying 12 items.
- Counting rooted spanning forests in cobordism of two circulant graphs (Q779138) (← links)
- Enumeration of noncrossing trees on a circle (Q1381832) (← links)
- Counting acyclic hypergraphs (Q1609631) (← links)
- Bounds on the chromatic polynomial and on the number of acyclic orientations of a graph (Q2563513) (← links)
- Counting rooted spanning forests for circulant foliation over a graph (Q2679743) (← links)
- The Potts model and the Tutte polynomial (Q2737867) (← links)
- Perfect sampling methods for random forests (Q3535658) (← links)
- The number of rooted forests in circulant graphs (Q5037930) (← links)
- On the number of labeled graphs of bounded treewidth (Q5915790) (← links)
- Combinatorial explanation of the weighted Laplacian characteristic polynomial of a graph and applications (Q6096283) (← links)
- On the Jacobian group of a cone over a circulant graph (Q6117337) (← links)
- Cyclic coverings of graphs. Counting rooted spanning forests and trees, Kirchhoff index, and Jacobians (Q6184481) (← links)