Stack Exchange network consists of 183 Q&A communities including Stack Overflow, the largest, most trusted online community for developers to learn, share their knowledge, and build their careers.
Are there known bounds on the number of proper 3-colorings of a graph with maximum degree at most 3-regular in terms of vertex count?
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?
Are there known bounds on the number of proper 3-colorings of a 3-regular in terms of vertex count?
