# How to get a list of graphs whose independence number equals to chromatic number?

The smallest number of colors needed to color a graph G is called its

**chromatic number**, and is often denoted χ(G).The

**independence number**α(G) of a graph G is the size of the largest independent set of G.