November 4th, 2011, 11:59 AM

correction: color sprawl - a set of colored nodes that are directly or indirectly connected via other colored nodes.

November 4th, 2011, 11:57 AM

Thanks for the response laserlight! .. From what I have seen, It appears that minimum colors are not guaranteed when we have multiple "starting nodes", forcing additional color constraints. My...

November 4th, 2011, 11:14 AM

correction:

… In code we could keep track of the color sequence in a bit map .. traversing this bit map for every node to select the lowest color in the sequence would add at most n * t to the...

November 2nd, 2011, 08:58 AM

I came up with a polynomial bounded algorithm (exponential to be specific) for graph coloring a year or two ago. Does anyone agree/disagree with my findings? Here is my doc:

Johnathon Pandich

...