scientific article; zbMATH DE number 2186866
From MaRDI portal
Publication:3023984
Recommendations
- A combinatorial identity for rooted labeled forests
- A counting formula for labeled, rooted forests
- Congruences for weighted number of labeled forests
- A combinatorial identity with applications to forest graphs
- A formula for the number of labelled trees
- On computing the distinguishing numbers of trees and forests
- The Forest Number of (n,m)-Graphs
- scientific article; zbMATH DE number 3926929
- Countingk-component forests of a graph
- A combinatorial proof of {P}ostnikov's identity and a generalized enumeration of labeled trees
Cited in
(14)- Improved bounds for the number of forests and acyclic orientations in the square lattice
- Counting rooted spanning forests for circulant foliation over a graph
- Congruences for weighted number of labeled forests
- scientific article; zbMATH DE number 3926929 (Why is no real title available?)
- The number of rooted forests in circulant graphs
- scientific article; zbMATH DE number 971754 (Why is no real title available?)
- Enumerating alternating trees
- A combinatorial approach to Golomb forests
- A counting formula for labeled, rooted forests
- 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
- q-hook length formulas for signed labeled forests
- An insertion algorithm and leaders of rooted trees
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3023984)