 In particular, rook's graphs are themselves perfect.Because a rook's graph is perfect, the number of colors needed in any coloring of the graph is just the size of its largest clique.The cliques of a rook's graph are the subsets of its rows and columns, and the largest of these have size , so this is also the chromatic number of the graph.