The following pages link to (Q2875496):
Displaying 19 items.
- Counting the number of non-equivalent vertex colorings of a graph (Q260025) (← 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)
- Fubini numbers and polynomials of graphs (Q2238749) (← links)
- The \(r\)-Lah numbers (Q2346327) (← links)
- Associated \(r\)-Dowling numbers and some relatives (Q2656158) (← links)
- (Q3596501) (← links)
- Sums of r-Lah numbers and r-Lah polynomials (Q4988849) (← links)
- (Q5026930) (← links)
- (Q5139711) (← 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)
- Ranking trees based on global centrality measures (Q6140248) (← links)
- On restricted \(r\)-Stirling numbers, also known as \(r\)-Bessel numbers (Q6562420) (← links)
- Partitions of vertices and facets in trees and stacked simplicial complexes (Q6580497) (← links)
- Generalizations of Stirling-like and Bell-like numbers (Q6610532) (← links)
