Colouring Graphs

[Jon Perry]

'  To ensure that every pair of vertices in M(c) have a different colour,
we can just add an edge between every pair of vertices in M(c).'

We can't just DO this. Once we have a graph, we assigned 'random' colours to
each edge, and then we must colour the vertices, following the rule that in
{M(c) U V} all vertices must be coloured differently.

Jon Perry
perry at globalnet.co.uk
http://www.users.globalnet.co.uk/~perry/maths/
http://www.users.globalnet.co.uk/~perry/DIVMenu/
BrainBench MVP for HTML and JavaScript
http://www.brainbench.com