You are not logged in.

- Topics: Active | Unanswered

Pages: **1**

**kadixt****Member**- Registered: 2010-10-26
- Posts: 1

Hi everyone,

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!!

Cheers,

Nelson

Offline

Pages: **1**