The following pages link to (Q3550089):
Displaying 7 items.
- Counting the number of non-equivalent vertex colorings of a graph (Q260025) (← links)
- On the real roots of \(\sigma\)-polynomials (Q343712) (← links)
- \(q\)-Stirling numbers of the second kind and \(q\)-Bell numbers for graphs (Q510631) (← links)
- Enumerating some stable partitions involving Stirling and \(r\)-Stirling numbers of the second kind (Q723786) (← links)
- A sharp lower bound on the number of non-equivalent colorings of graphs of order \(n\) and maximum degree \(n - 3\) (Q1686044) (← links)
- Note on some restricted Stirling numbers of the second kind (Q1695189) (← links)
- Restricted \(r\)-Stirling numbers and their combinatorial applications (Q2008814) (← links)
