Pages that link to "Item:Q1953467"
From MaRDI portal
The following pages link to Stirling numbers of forests and cycles (Q1953467):
Displaying 17 items.
- Counting the number of non-equivalent vertex colorings of a graph (Q260025) (← links)
- Asymptotic normality of some graph sequences (Q292264) (← links)
- On the real roots of \(\sigma\)-polynomials (Q343712) (← links)
- Enumerating some stable partitions involving Stirling and \(r\)-Stirling numbers of the second kind (Q723786) (← links)
- Generalized Stirling permutations and forests: higher-order Eulerian and Ward numbers (Q888595) (← links)
- A sharp lower bound on the number of non-equivalent colorings of graphs of order \(n\) and maximum degree \(n - 3\) (Q1686044) (← links)
- Two recurrence relations for Stirling factors (Q1971029) (← links)
- Restricted \(r\)-Stirling numbers and their combinatorial applications (Q2008814) (← links)
- Counting Coxeter's friezes over a finite field via moduli spaces (Q2031614) (← links)
- Fubini numbers and polynomials of graphs (Q2238749) (← links)
- Total non-negativity of some combinatorial matrices (Q2299628) (← links)
- On the roots of \(\sigma\)-polynomials (Q2811197) (← links)
- (Q5026930) (← links)
- ℱ-WORM colorings of some 2-trees: partition vectors (Q5225032) (← links)
- (Q5374239) (← links)
- Upper bounds on the average number of colors in the non-equivalent colorings of a graph (Q6045131) (← links)
- Lower bounds and properties for the average number of colors in the non-equivalent colorings of a graph (Q6046133) (← links)
