2 ms·
Not really, no. There are many, many results about when something is and is not three-colorable, but in the end, graph three coloring is NP-Complete.
by ColinWright 14y ago
Not really, no. There are many, many results about when something is and is not three-colorable, but in the end, graph three coloring is NP-Complete.
- mgallivan 14y agoThanks!