Let G be a graph with _(G) = k and let a k-coloring of G be given. Let H be the graph
Chapter 14, Problem 27(choose chapter or problem)
Let G be a graph with _(G) = k and let a k-coloring of G be given. Let H be the graph with V (H) = V (G) such that uv E(H) if u and v are assigned different colors in G. Determine _(H).
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