module Coloring:k-coloring of undirected graphs.sig
..end
A k-coloring of a graph g is a mapping c from nodes to {1,...,k} such
that c(u)<>c(v) for any edge u-v in g.
exception NoColoring
module type GM =sig
..end
module Mark:
module type G =sig
..end
module Make: