The following pages link to (Q3023984):
Displaying 14 items.
- \(q\)-hook length formulas for signed labeled forests (Q744166) (← links)
- An insertion algorithm and leaders of rooted trees (Q901150) (← links)
- Improved bounds for the number of forests and acyclic orientations in the square lattice (Q1856350) (← links)
- Counting rooted spanning forests for circulant foliation over a graph (Q2679743) (← links)
- Congruences for weighted number of labeled forests (Q2830360) (← links)
- (Q3701432) (← links)
- The number of rooted forests in circulant graphs (Q5037930) (← links)
- (Q5691420) (← links)
- Enumerating alternating trees (Q5937130) (← links)
- A combinatorial approach to Golomb forests (Q5941521) (← links)
- A counting formula for labeled, rooted forests (Q5960005) (← 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)
