Colouring Graphs

[Jon Perry]

Sorry...

Given a vertex V, let M(c) be the set of vertices adjacent to V along an
edge of colour c.

Each vertex in {M(c) U V} must be a different colour.

'If this is the case, then for your edge-coloured graph G we just have to
take each vertex and complete the sets of vertices forming your M(c) sets.
(to complete means to add an edge between every pair of vertices in the
set.) In which case it is not a very interesting colouring.'

Not sure that I follow...

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