Before revision:  Moreover , we obtain an exponential improvement for k-coloring for any constant k for a very large family of graphs.
After revision:  Moreover , we obtain an exponential improvement for computing the chromatic number of a very large family of graphs.