Among all 5-regular graphs, let G1 be one with the smallest chromatic number and let G2
Chapter 14, Problem 12(choose chapter or problem)
Among all 5-regular graphs, let G1 be one with the smallest chromatic number and let G2 be one with the largest chromatic number. Suppose that _(G1) = s and _(G2) = t. (a) What are s and t? (b) For each integer k with s < k < t, show that there exists a 5-regular graph Gk such that _(Gk) = k.
Unfortunately, we don't have that question answered yet. But you can get it answered in just 5 hours by Logging in or Becoming a subscriber.
Becoming a subscriber
Or look for another answer