[Haskell-beginners] Graph Coloring Library?

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'm not particularly concerned about speed, and it's unlikely that I'll generate really bad edge cases, but I'd prefer to do something other than write the really bad try-every-case algorithm. -- Alec Story Cornell University Biological Sciences, Computer Science 2012