@ARTICLE{Alikhani,
author = {Lau, G.-C. and Peng, Y.-H. and Alikhani, S. and },
title = {Chromaticity of Turan Graphs with At Most Three Edges Deleted},
volume = {9},
number = {2},
abstract ={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. },
URL = {http://ijmsi.ir/article-1-642-en.html},
eprint = {http://ijmsi.ir/article-1-642-en.pdf},
journal = {Iranian Journal of Mathematical Sciences and Informatics},
doi = {10.7508/ijmsi.2014.02.005},
year = {2014}
}