Register to reply

Harmonious coloring

by bob j
Tags: coloring, graph
Share this thread:
bob j
#1
Jan8-11, 01:16 AM
P: 22
Hi All,
does anyone know of any greedy or suboptimal algorithm to obtain harmonious coloring on a graph?
Phys.Org News Partner Mathematics news on Phys.org
Heat distributions help researchers to understand curved space
Professor quantifies how 'one thing leads to another'
Team announces construction of a formal computer-verified proof of the Kepler conjecture
sachinism
#2
Jan8-11, 04:46 AM
P: 66
what exactly do u want to use it for?
mXSCNT
#3
Jan9-11, 06:17 PM
P: 330
Sure, you could easily imagine a greedy suboptimal algorithm. Start with a connected graph where all nodes are colorless but one, which has color 1. Maintain a list of color pairs that have already been used. At every step, color a node which is adjacent to a previous node, using an existing color if possible, otherwise using a new color. Continue until all nodes are colored.


Register to reply

Related Discussions
The rights to be harmonious Current Events 82
Coloring SEM and TEM images Atomic, Solid State, Comp. Physics 3
Coloring In Powerade. Biology 13
Food coloring Chemistry 2
What is coloring a graph? General Math 1