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

tF rlr lf /\ l(z ^ "------I 1- \,, t X { ---|-' I -z.Y I ,V .( l+ u\ I X 7Y -__--_-- X \ \ x-{+-x lY ,-* +@ ---\/ Lh + r1t+ (t -*7 xt- )*FnJ ezo()& e) 7\ JvU -{) ,t o)fg'*)'-€:;7xrxr- t\ r-' :t,r) I x9-zx L/J