Need help finding...

[eigen]

A proof of the transformation from Satisfiablity to Graph coloring.

I have plenty of examples of hamiltonian paths cycle,covers, and clique.But not coloring..

Anybody no any site, texts or journals that show this.If so be specific, Journal number volume etc.

 

[Matthias99]

Can't you convert them both to some sort of covering problem (or other common type of NP problem)? That would prove equivalence (you know, a = b, b = c, therefore a = c and all that). It's been a while since I was a discrete mathematics TA, so I'd have to dig up some textbooks to find more details, but that's how I'd try to attack it.

 

[Stiganator]

are you asking about like fourth dimension analysis, i.e. force distribution on a 3D object with like coloring to indicate intensity, or is this something different?