Graph coloring as a matrix?

110 Views Asked by At

Is there anything interesting to be gained from representing a graph coloring as a matrix, where the rows correspond to vertices of the graph and columns to colors, and entry i,j = 1 if vertex i is colored with color j and i, j = 0 otherwise? I suppose we could see a graph coloring as a linear transformation from "color vectors" to "vertex vectors"?