I'm having trouble reducing a k-Colorability problem to an Exact Cover problem (NP problems).
I've got an algorithm that can do it for k=2, but does anyone know of a way to reduce for k>=3?
I've searched far and wide on Google, Bing etc but can't find anything.
Would really appreciated any advice!!