RT - Journal Article T1 - Chromaticity of Turan Graphs with At Most Three Edges Deleted JF - IJMSI YR - 2014 JO - IJMSI VO - 9 IS - 2 UR - http://ijmsi.ir/article-1-642-en.html SP - 45 EP - 64 K1 - Chromatic polynomial K1 - Chromatic uniqueness K1 - Turan graph. AB - Let $P(G,lambda)$ be the chromatic polynomial of a graph $G$. A graph $G$ ischromatically unique if for any graph $H$, $P(H, lambda) = P(G,lambda)$ implies $H$ is isomorphic to $G$. In this paper, we determine the chromaticity of all Tur'{a}n graphs with at most three edges deleted. As a by product, we found many families of chromatically unique graphs and chromatic equivalence classes of graphs. LA eng UL http://ijmsi.ir/article-1-642-en.html M3 10.7508/ijmsi.2014.02.005 ER -