Pages that link to "Item:Q6045131"
From MaRDI portal
The following pages link to Upper bounds on the average number of colors in the non-equivalent colorings of a graph (Q6045131):
Displaying 4 items.
- Counting the number of non-equivalent vertex colorings of a graph (Q260025) (← links)
- Bounds for mean colour numbers of graphs (Q1405125) (← links)
- A sharp lower bound on the number of non-equivalent colorings of graphs of order \(n\) and maximum degree \(n - 3\) (Q1686044) (← links)
- Lower bounds and properties for the average number of colors in the non-equivalent colorings of a graph (Q6046133) (← links)