[ColinWright]

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]

Thanks!