# Discrete Structures : Coloring

Not what you're looking for? Search our solutions OR ask your own Custom question.

Let G be a properly colored graph and let us suppose that one of the colours used is red. The set of all red-coloured vertices have a special property. What is it?

Graph colouring can be thought of as partitioning V(G) into subsets with this special property.

(See attachment for full background)

https://brainmass.com/math/discrete-structures/discrete-structures-coloring-30125

#### Solution Preview

Please see the attached file for the complete solution.

Thanks for using ...

#### Solution Summary

A coloring problem is solved. The solution received a rating of "5" from the student who posted the question.

$2.49