graph theory Let W_n be the wheel graph on n + 1 vertices (that is, a cycle C_n on n vertices with an additional vertex adjacent to all the other vertices). Find chi (W_n; k). Solution answer is 3, because the n+1th vertex which is connected to all other vertices has to be given a different color than all other nodes and for a cycle 2 colors are sufficient.