Pages that link to "Item:Q4242963"
From MaRDI portal
The following pages link to Some new bounds for the maximum number of vertex colorings of a (v,e)-graph (Q4242963):
Displaying 4 items.
- Counting the number of non-equivalent vertex colorings of a graph (Q260025) (← links)
- Maximizing proper colorings on graphs (Q490999) (← links)
- A sharp lower bound on the number of non-equivalent colorings of graphs of order \(n\) and maximum degree \(n - 3\) (Q1686044) (← links)
- The maximum number of colorings of graphs of given order and size: a survey (Q2317644) (← links)