Re:Graph Coloring, or Proof by Crayon
by ColinWright on Tuesday December 18, 2012 @05:45PM
(#4940061)
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.
[ Parent
| on HN ]