Today, I am writing on a very important topic of Graph theory, i.e.

“Chromatic Polynomial” that tells us the total number of different ways to color properly a given graph G using λ or fewer colors. In this post i have discussed chromatic polynomials of some specific Graphs like null graph, path, complete graph and complete bipartite graphs etc.

Thank you for reading.

In my next post, i will be posting a decomposition theorem that is useful in finding the chromatic polynomials of any finite graph.