THE CHROMATICITY OF CERTAIN GRAPHS WITH 5 TRIANGLES

Let W(n, k) denote the graph of order n obtained from the wheel W(n) b y deleting all but k consecutive spokes. In this note, we study the ch romaticity of graphs which share certain properties of W(n, 6) which c an be obtained from the coefficients of the chromatic polynomial of W( n, 6). In particular, we prove that W(n,6) is chromatically unique for all integers n greater-than-or-equal-to 8. We also obtain two additio nal families of chromatically unique graphs.