Write a different version of graph coloring $($clingo code$)$ with the following facts and rules: a$,$ b$,$ and c are vertices. There is an edge between a and b; and another edge between a and c$.$ blue and red are colors. A vertex X has color Y if it is not colored with a color except Y$.$ A vertex X is colored with a color except Y$,$ if Z is a color different from Y and vertex X has color Z$.$ If there is an edge between two vertices, they cannot have the same color $($constraint$).$ Enumerate all possible colorings.