Chromaticity of the complements of D_n
Ruying Liu · 2009
The paper show the chromaticity of some dense graphs by employing the adjoint polynomial. Let Pn denote the Path of order n, Dn the graph that identify a vertex of K3 with an end-vertex of P(n-2). we generalize the conclusion and obtain that the complements of Dn are chromatic uniqueness if and only if n≠4 and n≠8 , which completely solve this problem.