Pages that link to "Item:Q260025"
From MaRDI portal
The following pages link to Counting the number of non-equivalent vertex colorings of a graph (Q260025):
Displaying 6 items.
- 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)
- (Q5026930) (← 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)
