I have a problem where I need to find the smallest k-coloring for a graph that represents conflicts between objects.  Is there a Haskell library that will do this for me?  I&#39;m not particularly concerned about speed, and it&#39;s unlikely that I&#39;ll generate really bad edge cases, but I&#39;d prefer to do something other than write the really bad try-every-case algorithm.<br clear="all">

<br>-- <br>Alec Story<br>Cornell University<br>Biological Sciences, Computer Science 2012<br>