On chromatic polynomials of some kinds of graphs (Q705078): Difference between revisions

Let \(D_n\) be the graph consisting of \(K_3\) (a triangle) and the path \(P_{n-2}\) with \(n-2\) vertices, by coinciding a vertex of \(K_3\) with a vertex of degree \(l\) of \(P_{n-2}\). By \(F_n\), \(n\geq 6\), we mean the graph obtained from \(D_{n-2}\) and \(K_3\) by coinciding the vertex of degree \(l\) of \(D_{n-2}\) with a vertex of \(K_3\). A new method is used to calculate the chromatic polynomials of graphs. The chromatic polynmial of the complements of a wheel, a fan and the adjoint polynomials of \(F_n\) are obtained. It may be conjectured that the \(F_n\) are reducible for any odd \(n\).