This area studies the following topics: Necessary and sufficient conditions for the polynomial to be the chromatic polynomial of some graphs. Necessary and sufficient conditions for two graphs to be chromatically equivalent. Families of chromatically unique graphs. Construction of chromatically equivalent graphs. Characterize chromatically unique graphs. Distribution of roots of the chromatic polynomial. Bounds and inequalities of the chromatic polynomials of certain families of graphs.

Updated:: [amir_peli] Updated:: 23/12/2013 [azma]