G.-C. Lau

[ 1 ] - Chromaticity of Turan Graphs with At Most Three Edges Deleted

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 graph...