The following pages link to (Q3550089):
Displaying 20 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)
- Walks, partitions, and normal ordering (Q888618) (← 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)
- Fubini numbers and polynomials of graphs (Q2238749) (← links)
- Total non-negativity of some combinatorial matrices (Q2299628) (← links)
- Path decompositions of digraphs and their applications to Weyl algebra (Q2346478) (← links)
- On the Roots of σ-Polynomials (Q2811197) (← links)
- (Q5026930) (← links)
- Recent developments in combinatorial aspects of normal ordering (Q5056207) (← links)
- (Q5150526) (← 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)
- K-regular decomposable incidence structure of maximum degree (Q6193880) (← links)