（是非題）A stable set, or independent set, of a graph, is a subset of vertices with the property that no two vertices in the stable set are adjacent. The stability number $\alpha(G)$ of a graph G is the cardinality of the largest stable set. For the classic coloring problem where the colors of any pair of the adjacent vertices must be distinct, we can solve it by partitioning the graph into stable sets. Therefore, the chromatic number $\chi(G)$ of a graph G, that is, the minimum number of colors needed to color the graph, must be smaller than or equal to the stability number $\alpha(G)$ of the graph.