The colouring problem is to assign a colour to every vertex of a graph such that no two adjacent vertices have the same colour. These colours, of course, are not necessarily colours in the optic sense.
Consider the following graph:
One potential colouring of this graph is:
and have the same colour; and have a second colour; and and have another.
Graph colouring problems have many applications in such situations as scheduling and matching problems.
|Date of creation||2013-03-22 12:17:00|
|Last modified on||2013-03-22 12:17:00|
|Last modified by||vampyr (22)|