TY - JOUR
T1 - Chromaticity of Turan Graphs with At Most Three Edges Deleted
TT -
JF - IJMSI
JO - IJMSI
VL - 9
IS - 2
UR - http://ijmsi.ir/article-1-642-en.html
Y1 - 2014
SP - 45
EP - 64
KW - Chromatic polynomial
KW - Chromatic uniqueness
KW - Turan graph.
N2 - 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.
M3 10.7508/ijmsi.2014.02.005
ER -