Let G be a properly colored graph and let us suppose that one of the colors used is red
Chapter 52, Problem 52.6(choose chapter or problem)
Let G be a properly colored graph and let us suppose that one of the colors used is red. The set of all red-colored vertices have a special property. What is it? Graph coloring can be thought of as partitioning V .G/ into subsets with this special property
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