Are there known bounds on the number of proper 3-colorings of a graph with maximum degree at most 3 in terms of vertex count?
Bounds on the number of proper 3-colorings of (sub)cubic graphs
Tuatarian
- 83
- 5